./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_label32.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 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:49:37,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:49:37,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:49:37,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:49:37,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:49:37,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:49:37,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:49:37,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:49:37,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:49:37,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:49:37,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:49:37,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:49:37,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:49:37,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:49:37,948 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:49:37,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:37,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:49:37,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:49:37,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:49:37,950 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 -> 60c0fa34c18dde6742c3bd779d2643fe781c7455d58a961a280a354d3d1e679c [2025-02-05 11:49:38,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:49:38,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:49:38,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:49:38,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:49:38,153 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:49:38,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-02-05 11:49:39,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dca03fb3/801110d0770c4a8687f56c5c3c06be14/FLAGb8b2b0c3a [2025-02-05 11:49:39,709 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:49:39,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label32.c [2025-02-05 11:49:39,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dca03fb3/801110d0770c4a8687f56c5c3c06be14/FLAGb8b2b0c3a [2025-02-05 11:49:39,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dca03fb3/801110d0770c4a8687f56c5c3c06be14 [2025-02-05 11:49:39,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:49:39,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:49:39,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:39,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:49:39,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:49:39,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:39" (1/1) ... [2025-02-05 11:49:39,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d069181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:39, skipping insertion in model container [2025-02-05 11:49:39,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:39" (1/1) ... [2025-02-05 11:49:39,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:49:40,059 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_label32.c[5661,5674] [2025-02-05 11:49:40,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:40,188 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:49:40,212 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_label32.c[5661,5674] [2025-02-05 11:49:40,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:40,286 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:49:40,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40 WrapperNode [2025-02-05 11:49:40,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:40,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:40,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:49:40,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:49:40,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,348 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-02-05 11:49:40,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:40,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:49:40,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:49:40,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:49:40,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,393 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-02-05 11:49:40,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:49:40,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:49:40,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:49:40,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:49:40,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (1/1) ... [2025-02-05 11:49:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:40,466 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-02-05 11:49:40,469 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-02-05 11:49:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:49:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:49:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:49:40,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:49:40,536 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:49:40,537 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:49:41,484 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-05 11:49:41,484 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:49:41,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:49:41,500 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:49:41,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:41 BoogieIcfgContainer [2025-02-05 11:49:41,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:49:41,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:49:41,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:49:41,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:49:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:49:39" (1/3) ... [2025-02-05 11:49:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c338be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:41, skipping insertion in model container [2025-02-05 11:49:41,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:40" (2/3) ... [2025-02-05 11:49:41,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c338be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:41, skipping insertion in model container [2025-02-05 11:49:41,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:41" (3/3) ... [2025-02-05 11:49:41,507 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label32.c [2025-02-05 11:49:41,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:49:41,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label32.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:49:41,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:49:41,564 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;@2533231a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:49:41,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:49:41,568 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-02-05 11:49:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 11:49:41,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:41,573 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] [2025-02-05 11:49:41,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 324110218, now seen corresponding path program 1 times [2025-02-05 11:49:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338215227] [2025-02-05 11:49:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:41,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 11:49:41,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 11:49:41,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:41,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338215227] [2025-02-05 11:49:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338215227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:41,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158997565] [2025-02-05 11:49:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:41,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:41,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:41,920 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 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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-02-05 11:49:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:42,601 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-02-05 11:49:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2025-02-05 11:49:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:42,613 INFO L225 Difference]: With dead ends: 669 [2025-02-05 11:49:42,613 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 11:49:42,619 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-02-05 11:49:42,625 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:42,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 11:49:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-05 11:49:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 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-02-05 11:49:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2025-02-05 11:49:42,683 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 55 [2025-02-05 11:49:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:42,683 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2025-02-05 11:49:42,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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-02-05 11:49:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2025-02-05 11:49:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 11:49:42,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:42,686 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, 1, 1, 1, 1, 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-02-05 11:49:42,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:49:42,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 380108751, now seen corresponding path program 1 times [2025-02-05 11:49:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685498574] [2025-02-05 11:49:42,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:42,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 11:49:42,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 11:49:42,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:42,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685498574] [2025-02-05 11:49:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685498574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:42,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058032330] [2025-02-05 11:49:42,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:42,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:42,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:42,889 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-02-05 11:49:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:43,418 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2025-02-05 11:49:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130 [2025-02-05 11:49:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:43,422 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 11:49:43,422 INFO L226 Difference]: Without dead ends: 716 [2025-02-05 11:49:43,422 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-02-05 11:49:43,423 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:43,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-05 11:49:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-02-05 11:49:43,440 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-02-05 11:49:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-02-05 11:49:43,442 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 130 [2025-02-05 11:49:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:43,442 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-02-05 11:49:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-02-05 11:49:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-02-05 11:49:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 11:49:43,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:43,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:49:43,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:49:43,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 75601369, now seen corresponding path program 1 times [2025-02-05 11:49:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896508273] [2025-02-05 11:49:43,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:43,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 11:49:43,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 11:49:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896508273] [2025-02-05 11:49:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896508273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34464669] [2025-02-05 11:49:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:43,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:43,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:43,729 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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-02-05 11:49:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:44,442 INFO L93 Difference]: Finished difference Result 1964 states and 2570 transitions. [2025-02-05 11:49:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:44,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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 134 [2025-02-05 11:49:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:44,446 INFO L225 Difference]: With dead ends: 1964 [2025-02-05 11:49:44,447 INFO L226 Difference]: Without dead ends: 1250 [2025-02-05 11:49:44,448 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-02-05 11:49:44,448 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:44,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:49:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-02-05 11:49:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-02-05 11:49:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 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-02-05 11:49:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2025-02-05 11:49:44,491 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 134 [2025-02-05 11:49:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2025-02-05 11:49:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 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-02-05 11:49:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2025-02-05 11:49:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 11:49:44,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:44,494 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:44,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:49:44,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:44,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1095297585, now seen corresponding path program 1 times [2025-02-05 11:49:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810357673] [2025-02-05 11:49:44,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:44,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 11:49:44,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 11:49:44,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:44,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 11:49:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810357673] [2025-02-05 11:49:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810357673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62311525] [2025-02-05 11:49:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:44,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:44,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:44,780 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-02-05 11:49:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:45,373 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2025-02-05 11:49:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 214 [2025-02-05 11:49:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:45,381 INFO L225 Difference]: With dead ends: 2705 [2025-02-05 11:49:45,381 INFO L226 Difference]: Without dead ends: 1606 [2025-02-05 11:49:45,382 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-02-05 11:49:45,383 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:45,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-02-05 11:49:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-02-05 11:49:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 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-02-05 11:49:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2025-02-05 11:49:45,418 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 214 [2025-02-05 11:49:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:45,418 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2025-02-05 11:49:45,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-02-05 11:49:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2025-02-05 11:49:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-02-05 11:49:45,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:45,422 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:49:45,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1495244152, now seen corresponding path program 1 times [2025-02-05 11:49:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806532145] [2025-02-05 11:49:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:45,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-02-05 11:49:45,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-02-05 11:49:45,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 206 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:49:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806532145] [2025-02-05 11:49:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806532145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536678727] [2025-02-05 11:49:45,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:45,821 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-02-05 11:49:45,822 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-02-05 11:49:45,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-02-05 11:49:45,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-02-05 11:49:45,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:45,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:45,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:45,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:49:46,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:46,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536678727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:46,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:49:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724105643] [2025-02-05 11:49:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:46,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:46,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:46,039 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-02-05 11:49:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:46,468 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2025-02-05 11:49:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 341 [2025-02-05 11:49:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:46,474 INFO L225 Difference]: With dead ends: 3388 [2025-02-05 11:49:46,474 INFO L226 Difference]: Without dead ends: 1962 [2025-02-05 11:49:46,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:46,475 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:46,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 254 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-02-05 11:49:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2025-02-05 11:49:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1320754716981132) internal successors, (2220), 1961 states have internal predecessors, (2220), 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-02-05 11:49:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2220 transitions. [2025-02-05 11:49:46,498 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2220 transitions. Word has length 341 [2025-02-05 11:49:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:46,498 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2220 transitions. [2025-02-05 11:49:46,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-02-05 11:49:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2220 transitions. [2025-02-05 11:49:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-05 11:49:46,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:46,501 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:46,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:46,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 669512722, now seen corresponding path program 1 times [2025-02-05 11:49:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987292896] [2025-02-05 11:49:46,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:46,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 11:49:46,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 11:49:46,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:46,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 289 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987292896] [2025-02-05 11:49:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987292896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830741160] [2025-02-05 11:49:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:47,212 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-02-05 11:49:47,214 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-02-05 11:49:47,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 11:49:47,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 11:49:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:47,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:47,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-02-05 11:49:47,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830741160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:47,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760163441] [2025-02-05 11:49:47,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:47,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:47,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:47,386 INFO L87 Difference]: Start difference. First operand 1962 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-02-05 11:49:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:47,808 INFO L93 Difference]: Finished difference Result 4278 states and 4910 transitions. [2025-02-05 11:49:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 345 [2025-02-05 11:49:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:47,814 INFO L225 Difference]: With dead ends: 4278 [2025-02-05 11:49:47,814 INFO L226 Difference]: Without dead ends: 2496 [2025-02-05 11:49:47,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:47,816 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 126 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:47,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 252 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-02-05 11:49:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-02-05 11:49:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.1202404809619237) internal successors, (2795), 2495 states have internal predecessors, (2795), 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-02-05 11:49:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2795 transitions. [2025-02-05 11:49:47,847 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2795 transitions. Word has length 345 [2025-02-05 11:49:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:47,847 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2795 transitions. [2025-02-05 11:49:47,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-02-05 11:49:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2795 transitions. [2025-02-05 11:49:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 11:49:47,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:47,850 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:47,856 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-02-05 11:49:48,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:48,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:48,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1111214675, now seen corresponding path program 1 times [2025-02-05 11:49:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:48,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941872465] [2025-02-05 11:49:48,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:48,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 11:49:48,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 11:49:48,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:48,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 219 proven. 130 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 11:49:48,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941872465] [2025-02-05 11:49:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941872465] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689104711] [2025-02-05 11:49:48,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:48,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:48,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:48,398 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-02-05 11:49:48,400 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-02-05 11:49:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 11:49:48,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 11:49:48,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:48,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:48,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:48,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-02-05 11:49:48,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689104711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 11:49:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705821113] [2025-02-05 11:49:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:48,770 INFO L87 Difference]: Start difference. First operand 2496 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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-02-05 11:49:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:49,188 INFO L93 Difference]: Finished difference Result 5524 states and 6312 transitions. [2025-02-05 11:49:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:49,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 354 [2025-02-05 11:49:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:49,197 INFO L225 Difference]: With dead ends: 5524 [2025-02-05 11:49:49,197 INFO L226 Difference]: Without dead ends: 3208 [2025-02-05 11:49:49,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:49,200 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:49,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 52 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-02-05 11:49:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2025-02-05 11:49:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.1162099702872235) internal successors, (3381), 3029 states have internal predecessors, (3381), 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-02-05 11:49:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3381 transitions. [2025-02-05 11:49:49,235 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3381 transitions. Word has length 354 [2025-02-05 11:49:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:49,235 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3381 transitions. [2025-02-05 11:49:49,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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-02-05 11:49:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3381 transitions. [2025-02-05 11:49:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-02-05 11:49:49,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:49,238 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:49,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:49,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:49,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 401871655, now seen corresponding path program 1 times [2025-02-05 11:49:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504450650] [2025-02-05 11:49:49,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:49,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-02-05 11:49:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-02-05 11:49:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:49,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504450650] [2025-02-05 11:49:49,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504450650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:49,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:49,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002862428] [2025-02-05 11:49:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:49,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:49,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:49,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:49,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:49,582 INFO L87 Difference]: Start difference. First operand 3030 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-02-05 11:49:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:50,015 INFO L93 Difference]: Finished difference Result 6592 states and 7451 transitions. [2025-02-05 11:49:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:50,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 379 [2025-02-05 11:49:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:50,025 INFO L225 Difference]: With dead ends: 6592 [2025-02-05 11:49:50,025 INFO L226 Difference]: Without dead ends: 3742 [2025-02-05 11:49:50,027 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-02-05 11:49:50,028 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:50,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 58 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-02-05 11:49:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2025-02-05 11:49:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.1210906174819566) internal successors, (4194), 3741 states have internal predecessors, (4194), 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-02-05 11:49:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4194 transitions. [2025-02-05 11:49:50,071 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4194 transitions. Word has length 379 [2025-02-05 11:49:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:50,071 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4194 transitions. [2025-02-05 11:49:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-02-05 11:49:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4194 transitions. [2025-02-05 11:49:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-05 11:49:50,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:50,076 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:49:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:49:50,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1439735235, now seen corresponding path program 1 times [2025-02-05 11:49:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112672701] [2025-02-05 11:49:50,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-05 11:49:50,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-05 11:49:50,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:50,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 11:49:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112672701] [2025-02-05 11:49:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112672701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237637760] [2025-02-05 11:49:50,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:50,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:50,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:50,431 INFO L87 Difference]: Start difference. First operand 3742 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-02-05 11:49:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:50,821 INFO L93 Difference]: Finished difference Result 7838 states and 8810 transitions. [2025-02-05 11:49:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 439 [2025-02-05 11:49:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:50,833 INFO L225 Difference]: With dead ends: 7838 [2025-02-05 11:49:50,833 INFO L226 Difference]: Without dead ends: 4276 [2025-02-05 11:49:50,837 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-02-05 11:49:50,839 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:50,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-02-05 11:49:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2025-02-05 11:49:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.111812865497076) internal successors, (4753), 4275 states have internal predecessors, (4753), 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-02-05 11:49:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4753 transitions. [2025-02-05 11:49:50,889 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4753 transitions. Word has length 439 [2025-02-05 11:49:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:50,889 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4753 transitions. [2025-02-05 11:49:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-02-05 11:49:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4753 transitions. [2025-02-05 11:49:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 11:49:50,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:50,895 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, 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, 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] [2025-02-05 11:49:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:49:50,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:50,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 504590997, now seen corresponding path program 1 times [2025-02-05 11:49:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:50,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530853619] [2025-02-05 11:49:50,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 11:49:50,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 11:49:50,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:50,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-05 11:49:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530853619] [2025-02-05 11:49:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530853619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:51,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:51,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041339030] [2025-02-05 11:49:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:51,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:51,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:51,138 INFO L87 Difference]: Start difference. First operand 4276 states and 4753 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 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-02-05 11:49:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:51,597 INFO L93 Difference]: Finished difference Result 8608 states and 9579 transitions. [2025-02-05 11:49:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:51,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 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 519 [2025-02-05 11:49:51,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:51,607 INFO L225 Difference]: With dead ends: 8608 [2025-02-05 11:49:51,607 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 11:49:51,610 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-02-05 11:49:51,611 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:51,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 11:49:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-02-05 11:49:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.07953216374269) internal successors, (4615), 4275 states have internal predecessors, (4615), 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-02-05 11:49:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4615 transitions. [2025-02-05 11:49:51,693 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4615 transitions. Word has length 519 [2025-02-05 11:49:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4615 transitions. [2025-02-05 11:49:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 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-02-05 11:49:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4615 transitions. [2025-02-05 11:49:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-02-05 11:49:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:51,697 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, 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, 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] [2025-02-05 11:49:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:49:51,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 204620506, now seen corresponding path program 1 times [2025-02-05 11:49:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545491729] [2025-02-05 11:49:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:51,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-02-05 11:49:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-02-05 11:49:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-02-05 11:49:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545491729] [2025-02-05 11:49:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545491729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:51,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297303999] [2025-02-05 11:49:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:51,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:51,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:51,855 INFO L87 Difference]: Start difference. First operand 4276 states and 4615 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-02-05 11:49:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:52,240 INFO L93 Difference]: Finished difference Result 9084 states and 9847 transitions. [2025-02-05 11:49:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 534 [2025-02-05 11:49:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:52,251 INFO L225 Difference]: With dead ends: 9084 [2025-02-05 11:49:52,252 INFO L226 Difference]: Without dead ends: 4988 [2025-02-05 11:49:52,255 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-02-05 11:49:52,256 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:52,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 57 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-02-05 11:49:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2025-02-05 11:49:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0788166702656015) internal successors, (4996), 4631 states have internal predecessors, (4996), 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-02-05 11:49:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4996 transitions. [2025-02-05 11:49:52,385 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4996 transitions. Word has length 534 [2025-02-05 11:49:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:52,386 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4996 transitions. [2025-02-05 11:49:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-02-05 11:49:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4996 transitions. [2025-02-05 11:49:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-05 11:49:52,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:52,394 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, 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, 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] [2025-02-05 11:49:52,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:49:52,394 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:52,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -152324396, now seen corresponding path program 2 times [2025-02-05 11:49:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920688035] [2025-02-05 11:49:52,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 11:49:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:52,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 545 statements into 2 equivalence classes. [2025-02-05 11:49:52,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 545 statements. [2025-02-05 11:49:52,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 11:49:52,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-05 11:49:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920688035] [2025-02-05 11:49:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920688035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552967822] [2025-02-05 11:49:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:52,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:52,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:52,521 INFO L87 Difference]: Start difference. First operand 4632 states and 4996 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-02-05 11:49:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:53,054 INFO L93 Difference]: Finished difference Result 5702 states and 6166 transitions. [2025-02-05 11:49:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:53,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 545 [2025-02-05 11:49:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:53,087 INFO L225 Difference]: With dead ends: 5702 [2025-02-05 11:49:53,087 INFO L226 Difference]: Without dead ends: 5700 [2025-02-05 11:49:53,089 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-02-05 11:49:53,089 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-02-05 11:49:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4810. [2025-02-05 11:49:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0808899979205655) internal successors, (5198), 4809 states have internal predecessors, (5198), 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-02-05 11:49:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5198 transitions. [2025-02-05 11:49:53,202 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5198 transitions. Word has length 545 [2025-02-05 11:49:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:53,206 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5198 transitions. [2025-02-05 11:49:53,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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-02-05 11:49:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5198 transitions. [2025-02-05 11:49:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-02-05 11:49:53,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:53,216 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 4, 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] [2025-02-05 11:49:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:49:53,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash -875031387, now seen corresponding path program 1 times [2025-02-05 11:49:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803360069] [2025-02-05 11:49:53,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:53,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-02-05 11:49:53,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-02-05 11:49:53,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:53,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 940 proven. 11 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-02-05 11:49:54,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:54,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803360069] [2025-02-05 11:49:54,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803360069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:54,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161097401] [2025-02-05 11:49:54,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:54,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:54,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:54,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:49:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-02-05 11:49:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-02-05 11:49:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:54,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:54,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-02-05 11:49:54,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161097401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:49:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95395508] [2025-02-05 11:49:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:54,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:54,302 INFO L87 Difference]: Start difference. First operand 4810 states and 5198 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-05 11:49:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:54,914 INFO L93 Difference]: Finished difference Result 10686 states and 11564 transitions. [2025-02-05 11:49:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:54,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 627 [2025-02-05 11:49:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:54,927 INFO L225 Difference]: With dead ends: 10686 [2025-02-05 11:49:54,927 INFO L226 Difference]: Without dead ends: 5700 [2025-02-05 11:49:54,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 626 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-02-05 11:49:54,932 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 126 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:54,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 247 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-02-05 11:49:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4454. [2025-02-05 11:49:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0790478329216258) internal successors, (4805), 4453 states have internal predecessors, (4805), 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-02-05 11:49:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4805 transitions. [2025-02-05 11:49:54,999 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4805 transitions. Word has length 627 [2025-02-05 11:49:55,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:55,000 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4805 transitions. [2025-02-05 11:49:55,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-02-05 11:49:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4805 transitions. [2025-02-05 11:49:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-02-05 11:49:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:55,008 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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] [2025-02-05 11:49:55,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:49:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 11:49:55,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash -452969026, now seen corresponding path program 1 times [2025-02-05 11:49:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227017158] [2025-02-05 11:49:55,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:55,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 826 statements into 1 equivalence classes. [2025-02-05 11:49:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 826 of 826 statements. [2025-02-05 11:49:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1364 proven. 11 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-02-05 11:49:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227017158] [2025-02-05 11:49:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227017158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280495435] [2025-02-05 11:49:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:55,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:55,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:55,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:55,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:49:55,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 826 statements into 1 equivalence classes. [2025-02-05 11:49:56,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 826 of 826 statements. [2025-02-05 11:49:56,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:56,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:56,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:56,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1283 proven. 0 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-02-05 11:49:56,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:56,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280495435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:56,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:56,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:49:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402374492] [2025-02-05 11:49:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:56,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:56,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:56,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:56,309 INFO L87 Difference]: Start difference. First operand 4454 states and 4805 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-02-05 11:49:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:56,663 INFO L93 Difference]: Finished difference Result 8550 states and 9250 transitions. [2025-02-05 11:49:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 826 [2025-02-05 11:49:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:56,669 INFO L225 Difference]: With dead ends: 8550 [2025-02-05 11:49:56,669 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 11:49:56,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 825 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-02-05 11:49:56,672 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:56,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 213 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 11:49:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4276. [2025-02-05 11:49:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0699415204678362) internal successors, (4574), 4275 states have internal predecessors, (4574), 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-02-05 11:49:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4574 transitions. [2025-02-05 11:49:56,699 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4574 transitions. Word has length 826 [2025-02-05 11:49:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:56,700 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4574 transitions. [2025-02-05 11:49:56,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-02-05 11:49:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4574 transitions. [2025-02-05 11:49:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2025-02-05 11:49:56,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:56,707 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:56,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:49:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 11:49:56,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1196251280, now seen corresponding path program 1 times [2025-02-05 11:49:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265041650] [2025-02-05 11:49:56,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:56,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 880 statements into 1 equivalence classes. [2025-02-05 11:49:56,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 880 of 880 statements. [2025-02-05 11:49:56,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:56,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1559 proven. 155 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-02-05 11:49:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265041650] [2025-02-05 11:49:57,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265041650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955154801] [2025-02-05 11:49:57,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:57,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:57,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:57,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:57,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:49:57,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 880 statements into 1 equivalence classes. [2025-02-05 11:49:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 880 of 880 statements. [2025-02-05 11:49:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:57,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:57,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-02-05 11:49:57,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955154801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:49:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909462539] [2025-02-05 11:49:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:57,466 INFO L87 Difference]: Start difference. First operand 4276 states and 4574 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-02-05 11:49:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:57,841 INFO L93 Difference]: Finished difference Result 5166 states and 5535 transitions. [2025-02-05 11:49:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:57,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 880 [2025-02-05 11:49:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:57,842 INFO L225 Difference]: With dead ends: 5166 [2025-02-05 11:49:57,842 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:49:57,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 880 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:57,846 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 147 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:57,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:49:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:49:57,847 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-02-05 11:49:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:49:57,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 880 [2025-02-05 11:49:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:57,847 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:49:57,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-02-05 11:49:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:49:57,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:49:57,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:49:57,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 11:49:58,053 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:58,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:49:58,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:49:58,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:49:58 BoogieIcfgContainer [2025-02-05 11:49:58,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:49:58,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:49:58,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:49:58,442 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:49:58,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:41" (3/4) ... [2025-02-05 11:49:58,444 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:49:58,462 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:49:58,462 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:49:58,463 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:49:58,464 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:49:58,594 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:49:58,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:49:58,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:49:58,596 INFO L158 Benchmark]: Toolchain (without parser) took 18663.79ms. Allocated memory was 201.3MB in the beginning and 780.1MB in the end (delta: 578.8MB). Free memory was 156.5MB in the beginning and 503.0MB in the end (delta: -346.5MB). Peak memory consumption was 233.9MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:49:58,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.06ms. Allocated memory is still 201.3MB. Free memory was 156.1MB in the beginning and 124.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.92ms. Allocated memory is still 201.3MB. Free memory was 124.2MB in the beginning and 115.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,597 INFO L158 Benchmark]: Boogie Preprocessor took 88.93ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 103.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,597 INFO L158 Benchmark]: IcfgBuilder took 1061.91ms. Allocated memory is still 201.3MB. Free memory was 103.8MB in the beginning and 87.1MB in the end (delta: 16.7MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,597 INFO L158 Benchmark]: TraceAbstraction took 16939.89ms. Allocated memory was 201.3MB in the beginning and 780.1MB in the end (delta: 578.8MB). Free memory was 86.1MB in the beginning and 515.6MB in the end (delta: -429.5MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,597 INFO L158 Benchmark]: Witness Printer took 153.11ms. Allocated memory is still 780.1MB. Free memory was 515.6MB in the beginning and 503.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:58,598 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.20ms. Allocated memory is still 218.1MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.06ms. Allocated memory is still 201.3MB. Free memory was 156.1MB in the beginning and 124.2MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.92ms. Allocated memory is still 201.3MB. Free memory was 124.2MB in the beginning and 115.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.93ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 103.8MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1061.91ms. Allocated memory is still 201.3MB. Free memory was 103.8MB in the beginning and 87.1MB in the end (delta: 16.7MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16939.89ms. Allocated memory was 201.3MB in the beginning and 780.1MB in the end (delta: 578.8MB). Free memory was 86.1MB in the beginning and 515.6MB in the end (delta: -429.5MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. * Witness Printer took 153.11ms. Allocated memory is still 780.1MB. Free memory was 515.6MB in the beginning and 503.0MB in the end (delta: 12.6MB). 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: 179]: 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: 16.5s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1858 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1858 mSDsluCounter, 1678 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 1017 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7659 IncrementalHoareTripleChecker+Invalid, 8676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1017 mSolverCounterUnsat, 1598 mSDtfsCounter, 7659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3417 GetRequests, 3380 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=12, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 9695 NumberOfCodeBlocks, 9205 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9674 ConstructedInterpolants, 0 QuantifiedInterpolants, 28398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4234 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 16381/16948 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]: Location Invariant Derived location invariant: ((((((((a24 == 1) && (a21 <= 8)) || (((a12 <= 11) && (a24 == 1)) && (10 <= a21))) || ((a24 == 1) && (81 <= a12))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || ((a24 == 1) && (a15 <= 5))) || (((a12 <= 11) && (a24 == 1)) && (a15 <= 8))) || (((a21 <= 7) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:49:58,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE