./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label36.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/Problem03_label36.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 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:47:15,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:47:15,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:47:15,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:47:15,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:47:15,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:47:15,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:47:15,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:47:15,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:47:15,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:47:15,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:47:15,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:47:15,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:47:15,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:47:15,824 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:47:15,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:47:15,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:47:15,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:47:15,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:47:15,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:15,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:47:15,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:47:15,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:47:15,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:47:15,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:47:15,827 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 -> 62e9241ba979767c8bca2756b2edfc882f7b20aa81fc6f783856c8cd54d80552 [2025-02-05 10:47:16,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:47:16,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:47:16,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:47:16,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:47:16,025 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:47:16,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2025-02-05 10:47:17,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/361196a84/4898aaca8a86411d99c80f91ea98b856/FLAG6d620f5a5 [2025-02-05 10:47:17,639 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:47:17,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label36.c [2025-02-05 10:47:17,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/361196a84/4898aaca8a86411d99c80f91ea98b856/FLAG6d620f5a5 [2025-02-05 10:47:17,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/361196a84/4898aaca8a86411d99c80f91ea98b856 [2025-02-05 10:47:17,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:47:17,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:47:17,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:17,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:47:17,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:47:17,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:17" (1/1) ... [2025-02-05 10:47:17,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678ba02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:17, skipping insertion in model container [2025-02-05 10:47:17,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:17" (1/1) ... [2025-02-05 10:47:17,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:47:18,045 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/Problem03_label36.c[58393,58406] [2025-02-05 10:47:18,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:18,075 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:47:18,185 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/Problem03_label36.c[58393,58406] [2025-02-05 10:47:18,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:18,213 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:47:18,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18 WrapperNode [2025-02-05 10:47:18,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:18,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:18,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:47:18,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:47:18,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,350 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:47:18,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:18,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:47:18,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:47:18,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:47:18,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,417 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 10:47:18,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:47:18,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:47:18,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:47:18,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:47:18,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (1/1) ... [2025-02-05 10:47:18,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:18,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:18,517 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 10:47:18,527 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 10:47:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:47:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:47:18,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:47:18,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:47:18,614 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:47:18,615 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:47:20,114 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:47:20,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:47:20,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:47:20,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:47:20,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:20 BoogieIcfgContainer [2025-02-05 10:47:20,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:47:20,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:47:20,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:47:20,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:47:20,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:47:17" (1/3) ... [2025-02-05 10:47:20,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feea8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:20, skipping insertion in model container [2025-02-05 10:47:20,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:18" (2/3) ... [2025-02-05 10:47:20,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feea8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:20, skipping insertion in model container [2025-02-05 10:47:20,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:20" (3/3) ... [2025-02-05 10:47:20,131 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label36.c [2025-02-05 10:47:20,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:47:20,142 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label36.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:47:20,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:47:20,185 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;@379157dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:47:20,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:47:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 10:47:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 10:47:20,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:20,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:20,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1648815476, now seen corresponding path program 1 times [2025-02-05 10:47:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:20,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611133742] [2025-02-05 10:47:20,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:20,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 10:47:20,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 10:47:20,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:20,910 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 10:47:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611133742] [2025-02-05 10:47:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611133742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199023927] [2025-02-05 10:47:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:20,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:20,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:20,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:20,932 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 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 10:47:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:21,781 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-02-05 10:47:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:21,783 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 179 [2025-02-05 10:47:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:21,791 INFO L225 Difference]: With dead ends: 857 [2025-02-05 10:47:21,791 INFO L226 Difference]: Without dead ends: 462 [2025-02-05 10:47:21,793 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 10:47:21,795 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 109 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:21,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:47:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-05 10:47:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-02-05 10:47:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 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 10:47:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-02-05 10:47:21,831 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 179 [2025-02-05 10:47:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-02-05 10:47:21,832 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 10:47:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-02-05 10:47:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 10:47:21,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:21,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:47:21,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -21047714, now seen corresponding path program 1 times [2025-02-05 10:47:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:21,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396750071] [2025-02-05 10:47:21,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 10:47:21,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 10:47:21,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:21,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396750071] [2025-02-05 10:47:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396750071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252970095] [2025-02-05 10:47:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:22,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:22,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:22,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:22,004 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 10:47:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:22,675 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-02-05 10:47:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 187 [2025-02-05 10:47:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:22,679 INFO L225 Difference]: With dead ends: 1344 [2025-02-05 10:47:22,679 INFO L226 Difference]: Without dead ends: 886 [2025-02-05 10:47:22,683 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 10:47:22,684 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:22,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-05 10:47:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-02-05 10:47:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 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 10:47:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions. [2025-02-05 10:47:22,734 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 187 [2025-02-05 10:47:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions. [2025-02-05 10:47:22,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 10:47:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions. [2025-02-05 10:47:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 10:47:22,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:22,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:47:22,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:22,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash -309112455, now seen corresponding path program 1 times [2025-02-05 10:47:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:22,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624842330] [2025-02-05 10:47:22,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:22,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 10:47:22,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 10:47:22,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:22,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624842330] [2025-02-05 10:47:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624842330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404933494] [2025-02-05 10:47:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:47:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:23,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:47:23,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:23,440 INFO L87 Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:24,207 INFO L93 Difference]: Finished difference Result 1884 states and 2886 transitions. [2025-02-05 10:47:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:47:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-05 10:47:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:24,212 INFO L225 Difference]: With dead ends: 1884 [2025-02-05 10:47:24,213 INFO L226 Difference]: Without dead ends: 842 [2025-02-05 10:47:24,214 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 10:47:24,215 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:24,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-02-05 10:47:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2025-02-05 10:47:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.3650416171224733) internal successors, (1148), 841 states have internal predecessors, (1148), 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 10:47:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1148 transitions. [2025-02-05 10:47:24,230 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1148 transitions. Word has length 194 [2025-02-05 10:47:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:24,231 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1148 transitions. [2025-02-05 10:47:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1148 transitions. [2025-02-05 10:47:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 10:47:24,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:24,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:24,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:47:24,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:24,234 INFO L85 PathProgramCache]: Analyzing trace with hash 915108217, now seen corresponding path program 1 times [2025-02-05 10:47:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848593654] [2025-02-05 10:47:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:24,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 10:47:24,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 10:47:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:24,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848593654] [2025-02-05 10:47:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848593654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155788738] [2025-02-05 10:47:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:24,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:24,406 INFO L87 Difference]: Start difference. First operand 842 states and 1148 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 10:47:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:24,950 INFO L93 Difference]: Finished difference Result 2504 states and 3420 transitions. [2025-02-05 10:47:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 202 [2025-02-05 10:47:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:24,955 INFO L225 Difference]: With dead ends: 2504 [2025-02-05 10:47:24,955 INFO L226 Difference]: Without dead ends: 1664 [2025-02-05 10:47:24,956 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 10:47:24,957 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 227 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:24,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 71 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-02-05 10:47:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1663. [2025-02-05 10:47:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.3243080625752106) internal successors, (2201), 1662 states have internal predecessors, (2201), 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 10:47:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2201 transitions. [2025-02-05 10:47:24,980 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2201 transitions. Word has length 202 [2025-02-05 10:47:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:24,980 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2201 transitions. [2025-02-05 10:47:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 10:47:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2201 transitions. [2025-02-05 10:47:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 10:47:24,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:24,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:47:24,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1546923251, now seen corresponding path program 1 times [2025-02-05 10:47:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35014022] [2025-02-05 10:47:24,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:25,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 10:47:25,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 10:47:25,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35014022] [2025-02-05 10:47:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35014022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972140674] [2025-02-05 10:47:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:47:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:25,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:47:25,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:47:25,498 INFO L87 Difference]: Start difference. First operand 1663 states and 2201 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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 10:47:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:26,412 INFO L93 Difference]: Finished difference Result 4323 states and 5738 transitions. [2025-02-05 10:47:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:47:26,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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 210 [2025-02-05 10:47:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:26,420 INFO L225 Difference]: With dead ends: 4323 [2025-02-05 10:47:26,420 INFO L226 Difference]: Without dead ends: 2488 [2025-02-05 10:47:26,422 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 10:47:26,422 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:26,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 100 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 10:47:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-02-05 10:47:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2487. [2025-02-05 10:47:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.3073209975864843) internal successors, (3250), 2486 states have internal predecessors, (3250), 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 10:47:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3250 transitions. [2025-02-05 10:47:26,494 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3250 transitions. Word has length 210 [2025-02-05 10:47:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3250 transitions. [2025-02-05 10:47:26,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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 10:47:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3250 transitions. [2025-02-05 10:47:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 10:47:26,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:26,499 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:47:26,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -724511829, now seen corresponding path program 1 times [2025-02-05 10:47:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390602392] [2025-02-05 10:47:26,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 10:47:26,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 10:47:26,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:26,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:47:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390602392] [2025-02-05 10:47:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390602392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:26,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198060273] [2025-02-05 10:47:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:26,684 INFO L87 Difference]: Start difference. First operand 2487 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 10:47:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:27,279 INFO L93 Difference]: Finished difference Result 6628 states and 8636 transitions. [2025-02-05 10:47:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 212 [2025-02-05 10:47:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:27,292 INFO L225 Difference]: With dead ends: 6628 [2025-02-05 10:47:27,292 INFO L226 Difference]: Without dead ends: 4143 [2025-02-05 10:47:27,296 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 10:47:27,296 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:27,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 117 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2025-02-05 10:47:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4140. [2025-02-05 10:47:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.296206813239913) internal successors, (5365), 4139 states have internal predecessors, (5365), 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 10:47:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5365 transitions. [2025-02-05 10:47:27,369 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5365 transitions. Word has length 212 [2025-02-05 10:47:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:27,369 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5365 transitions. [2025-02-05 10:47:27,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 10:47:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5365 transitions. [2025-02-05 10:47:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 10:47:27,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:27,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:27,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:47:27,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:27,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1706620526, now seen corresponding path program 1 times [2025-02-05 10:47:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:27,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825445853] [2025-02-05 10:47:27,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:27,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 10:47:27,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:47:27,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825445853] [2025-02-05 10:47:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825445853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008646935] [2025-02-05 10:47:28,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:28,109 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 10:47:28,110 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 10:47:28,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 10:47:28,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 10:47:28,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:28,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:28,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:28,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 10:47:28,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:28,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008646935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:28,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:28,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211999746] [2025-02-05 10:47:28,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:28,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:28,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:28,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:28,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:28,484 INFO L87 Difference]: Start difference. First operand 4140 states and 5365 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 10:47:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:29,077 INFO L93 Difference]: Finished difference Result 8287 states and 10744 transitions. [2025-02-05 10:47:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 217 [2025-02-05 10:47:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:29,090 INFO L225 Difference]: With dead ends: 8287 [2025-02-05 10:47:29,091 INFO L226 Difference]: Without dead ends: 4149 [2025-02-05 10:47:29,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:29,097 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:29,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 320 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2025-02-05 10:47:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4140. [2025-02-05 10:47:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.285817830393815) internal successors, (5322), 4139 states have internal predecessors, (5322), 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 10:47:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5322 transitions. [2025-02-05 10:47:29,181 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5322 transitions. Word has length 217 [2025-02-05 10:47:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:29,183 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5322 transitions. [2025-02-05 10:47:29,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 10:47:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5322 transitions. [2025-02-05 10:47:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 10:47:29,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:29,191 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:29,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:47:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:29,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -209503017, now seen corresponding path program 1 times [2025-02-05 10:47:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200738385] [2025-02-05 10:47:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:29,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:29,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:29,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200738385] [2025-02-05 10:47:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200738385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877362134] [2025-02-05 10:47:30,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:30,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:30,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:30,117 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 10:47:30,118 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 10:47:30,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:30,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:30,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:30,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:30,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:30,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:47:30,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877362134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903023460] [2025-02-05 10:47:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:30,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:30,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:30,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:30,414 INFO L87 Difference]: Start difference. First operand 4140 states and 5322 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 10:47:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:31,163 INFO L93 Difference]: Finished difference Result 12344 states and 15868 transitions. [2025-02-05 10:47:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 223 [2025-02-05 10:47:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:31,185 INFO L225 Difference]: With dead ends: 12344 [2025-02-05 10:47:31,185 INFO L226 Difference]: Without dead ends: 8206 [2025-02-05 10:47:31,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:31,192 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:31,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 343 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2025-02-05 10:47:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 8200. [2025-02-05 10:47:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8200 states, 8199 states have (on average 1.1763629710940358) internal successors, (9645), 8199 states have internal predecessors, (9645), 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 10:47:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 9645 transitions. [2025-02-05 10:47:31,311 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 9645 transitions. Word has length 223 [2025-02-05 10:47:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:31,311 INFO L471 AbstractCegarLoop]: Abstraction has 8200 states and 9645 transitions. [2025-02-05 10:47:31,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 10:47:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 9645 transitions. [2025-02-05 10:47:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 10:47:31,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:31,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:31,330 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 10:47:31,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:31,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:31,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1241179501, now seen corresponding path program 1 times [2025-02-05 10:47:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274985670] [2025-02-05 10:47:31,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:31,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 10:47:31,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 10:47:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274985670] [2025-02-05 10:47:31,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274985670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:31,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:31,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048017602] [2025-02-05 10:47:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:31,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:31,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:31,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:31,622 INFO L87 Difference]: Start difference. First operand 8200 states and 9645 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 10:47:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:32,355 INFO L93 Difference]: Finished difference Result 24139 states and 28367 transitions. [2025-02-05 10:47:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:32,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 233 [2025-02-05 10:47:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:32,395 INFO L225 Difference]: With dead ends: 24139 [2025-02-05 10:47:32,395 INFO L226 Difference]: Without dead ends: 15941 [2025-02-05 10:47:32,420 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 10:47:32,420 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 226 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:32,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 329 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15941 states. [2025-02-05 10:47:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15941 to 15932. [2025-02-05 10:47:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15932 states, 15931 states have (on average 1.151214613018643) internal successors, (18340), 15931 states have internal predecessors, (18340), 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 10:47:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15932 states to 15932 states and 18340 transitions. [2025-02-05 10:47:32,662 INFO L78 Accepts]: Start accepts. Automaton has 15932 states and 18340 transitions. Word has length 233 [2025-02-05 10:47:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:32,662 INFO L471 AbstractCegarLoop]: Abstraction has 15932 states and 18340 transitions. [2025-02-05 10:47:32,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 10:47:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15932 states and 18340 transitions. [2025-02-05 10:47:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 10:47:32,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:32,681 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:32,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:47:32,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:32,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash 487257242, now seen corresponding path program 1 times [2025-02-05 10:47:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084990760] [2025-02-05 10:47:32,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:32,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 10:47:32,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 10:47:32,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:32,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 10:47:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084990760] [2025-02-05 10:47:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084990760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429435391] [2025-02-05 10:47:33,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:33,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:33,056 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 10:47:33,059 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 10:47:33,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 10:47:33,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 10:47:33,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:33,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:33,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:47:33,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:33,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429435391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:47:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78769811] [2025-02-05 10:47:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:33,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:33,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:33,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:33,235 INFO L87 Difference]: Start difference. First operand 15932 states and 18340 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 10:47:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:33,972 INFO L93 Difference]: Finished difference Result 37755 states and 44080 transitions. [2025-02-05 10:47:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 252 [2025-02-05 10:47:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:34,005 INFO L225 Difference]: With dead ends: 37755 [2025-02-05 10:47:34,005 INFO L226 Difference]: Without dead ends: 21825 [2025-02-05 10:47:34,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:34,022 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 204 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:34,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 114 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21825 states. [2025-02-05 10:47:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21825 to 21819. [2025-02-05 10:47:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 21818 states have (on average 1.130442753689614) internal successors, (24664), 21818 states have internal predecessors, (24664), 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 10:47:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 24664 transitions. [2025-02-05 10:47:34,291 INFO L78 Accepts]: Start accepts. Automaton has 21819 states and 24664 transitions. Word has length 252 [2025-02-05 10:47:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:34,292 INFO L471 AbstractCegarLoop]: Abstraction has 21819 states and 24664 transitions. [2025-02-05 10:47:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 10:47:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21819 states and 24664 transitions. [2025-02-05 10:47:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 10:47:34,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:34,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:34,319 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 10:47:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:34,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1749528215, now seen corresponding path program 1 times [2025-02-05 10:47:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327581195] [2025-02-05 10:47:34,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:34,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 10:47:34,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 10:47:34,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:34,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327581195] [2025-02-05 10:47:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327581195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401550313] [2025-02-05 10:47:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:34,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:34,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:34,670 INFO L87 Difference]: Start difference. First operand 21819 states and 24664 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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 10:47:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:35,289 INFO L93 Difference]: Finished difference Result 59134 states and 66898 transitions. [2025-02-05 10:47:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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 254 [2025-02-05 10:47:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:35,343 INFO L225 Difference]: With dead ends: 59134 [2025-02-05 10:47:35,343 INFO L226 Difference]: Without dead ends: 37317 [2025-02-05 10:47:35,365 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 10:47:35,366 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 155 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:35,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 142 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37317 states. [2025-02-05 10:47:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37317 to 37314. [2025-02-05 10:47:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37314 states, 37313 states have (on average 1.1302227105834428) internal successors, (42172), 37313 states have internal predecessors, (42172), 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 10:47:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37314 states to 37314 states and 42172 transitions. [2025-02-05 10:47:35,797 INFO L78 Accepts]: Start accepts. Automaton has 37314 states and 42172 transitions. Word has length 254 [2025-02-05 10:47:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:35,797 INFO L471 AbstractCegarLoop]: Abstraction has 37314 states and 42172 transitions. [2025-02-05 10:47:35,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 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 10:47:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 37314 states and 42172 transitions. [2025-02-05 10:47:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 10:47:35,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:35,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:47:35,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -910261841, now seen corresponding path program 1 times [2025-02-05 10:47:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532000675] [2025-02-05 10:47:35,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:35,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 10:47:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 10:47:35,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532000675] [2025-02-05 10:47:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532000675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115753593] [2025-02-05 10:47:36,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:36,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:36,692 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 10:47:36,693 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 10:47:36,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 10:47:36,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 10:47:36,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:36,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:36,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:36,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:37,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115753593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:37,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:37,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054378010] [2025-02-05 10:47:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:37,007 INFO L87 Difference]: Start difference. First operand 37314 states and 42172 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 10:47:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:37,699 INFO L93 Difference]: Finished difference Result 74638 states and 84362 transitions. [2025-02-05 10:47:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 259 [2025-02-05 10:47:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:37,746 INFO L225 Difference]: With dead ends: 74638 [2025-02-05 10:47:37,746 INFO L226 Difference]: Without dead ends: 37326 [2025-02-05 10:47:37,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:37,773 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 84 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:37,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37326 states. [2025-02-05 10:47:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37326 to 37314. [2025-02-05 10:47:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37314 states, 37313 states have (on average 1.1232814300645888) internal successors, (41913), 37313 states have internal predecessors, (41913), 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 10:47:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37314 states to 37314 states and 41913 transitions. [2025-02-05 10:47:38,175 INFO L78 Accepts]: Start accepts. Automaton has 37314 states and 41913 transitions. Word has length 259 [2025-02-05 10:47:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:38,175 INFO L471 AbstractCegarLoop]: Abstraction has 37314 states and 41913 transitions. [2025-02-05 10:47:38,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 10:47:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 37314 states and 41913 transitions. [2025-02-05 10:47:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 10:47:38,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:38,202 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:38,211 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 10:47:38,404 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,SelfDestructingSolverStorable11 [2025-02-05 10:47:38,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1247207891, now seen corresponding path program 1 times [2025-02-05 10:47:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149756280] [2025-02-05 10:47:38,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 10:47:38,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 10:47:38,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 125 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 10:47:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149756280] [2025-02-05 10:47:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149756280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990911224] [2025-02-05 10:47:39,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:39,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:39,265 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 10:47:39,266 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 10:47:39,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 10:47:39,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 10:47:39,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:39,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:39,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:47:39,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:39,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990911224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469750508] [2025-02-05 10:47:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:39,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:39,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:39,430 INFO L87 Difference]: Start difference. First operand 37314 states and 41913 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 10:47:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:40,056 INFO L93 Difference]: Finished difference Result 74386 states and 83512 transitions. [2025-02-05 10:47:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 301 [2025-02-05 10:47:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:40,110 INFO L225 Difference]: With dead ends: 74386 [2025-02-05 10:47:40,111 INFO L226 Difference]: Without dead ends: 37074 [2025-02-05 10:47:40,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:40,138 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:40,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 313 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37074 states. [2025-02-05 10:47:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37074 to 37067. [2025-02-05 10:47:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37067 states, 37066 states have (on average 1.0992823611935467) internal successors, (40746), 37066 states have internal predecessors, (40746), 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 10:47:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37067 states to 37067 states and 40746 transitions. [2025-02-05 10:47:40,467 INFO L78 Accepts]: Start accepts. Automaton has 37067 states and 40746 transitions. Word has length 301 [2025-02-05 10:47:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 37067 states and 40746 transitions. [2025-02-05 10:47:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 10:47:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37067 states and 40746 transitions. [2025-02-05 10:47:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 10:47:40,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:40,495 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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 10:47:40,501 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 10:47:40,695 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,SelfDestructingSolverStorable12 [2025-02-05 10:47:40,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:40,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 141537353, now seen corresponding path program 1 times [2025-02-05 10:47:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:40,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317253538] [2025-02-05 10:47:40,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:40,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 10:47:40,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 10:47:40,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:40,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 10:47:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:41,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317253538] [2025-02-05 10:47:41,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317253538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:41,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480396583] [2025-02-05 10:47:41,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:41,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:41,640 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 10:47:41,643 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 10:47:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 10:47:41,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 10:47:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:41,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:47:41,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:41,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480396583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277708857] [2025-02-05 10:47:41,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:41,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:41,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:41,940 INFO L87 Difference]: Start difference. First operand 37067 states and 40746 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 10:47:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:42,609 INFO L93 Difference]: Finished difference Result 73932 states and 81262 transitions. [2025-02-05 10:47:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-02-05 10:47:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:42,658 INFO L225 Difference]: With dead ends: 73932 [2025-02-05 10:47:42,658 INFO L226 Difference]: Without dead ends: 36867 [2025-02-05 10:47:42,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:42,686 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:42,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 298 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36867 states. [2025-02-05 10:47:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36867 to 35234. [2025-02-05 10:47:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35234 states, 35233 states have (on average 1.0844095024550848) internal successors, (38207), 35233 states have internal predecessors, (38207), 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 10:47:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35234 states to 35234 states and 38207 transitions. [2025-02-05 10:47:43,110 INFO L78 Accepts]: Start accepts. Automaton has 35234 states and 38207 transitions. Word has length 347 [2025-02-05 10:47:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:43,111 INFO L471 AbstractCegarLoop]: Abstraction has 35234 states and 38207 transitions. [2025-02-05 10:47:43,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 10:47:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35234 states and 38207 transitions. [2025-02-05 10:47:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 10:47:43,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:43,145 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:43,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:47:43,345 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,SelfDestructingSolverStorable13 [2025-02-05 10:47:43,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:43,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -870551459, now seen corresponding path program 1 times [2025-02-05 10:47:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277951196] [2025-02-05 10:47:43,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:43,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 10:47:43,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 10:47:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 214 proven. 6 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-02-05 10:47:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277951196] [2025-02-05 10:47:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277951196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820324737] [2025-02-05 10:47:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:44,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:44,746 INFO L229 MonitoredProcess]: Starting monitored process 8 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 10:47:44,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:47:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 10:47:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 10:47:44,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:44,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:44,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 10:47:45,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820324737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:45,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:45,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829661293] [2025-02-05 10:47:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:45,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:45,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:45,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:45,042 INFO L87 Difference]: Start difference. First operand 35234 states and 38207 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 10:47:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:45,657 INFO L93 Difference]: Finished difference Result 68843 states and 74571 transitions. [2025-02-05 10:47:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:45,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 394 [2025-02-05 10:47:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:45,706 INFO L225 Difference]: With dead ends: 68843 [2025-02-05 10:47:45,706 INFO L226 Difference]: Without dead ends: 33611 [2025-02-05 10:47:45,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:45,730 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 167 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:45,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 80 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:47:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33611 states. [2025-02-05 10:47:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33611 to 32786. [2025-02-05 10:47:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32786 states, 32785 states have (on average 1.068933963702913) internal successors, (35045), 32785 states have internal predecessors, (35045), 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 10:47:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32786 states to 32786 states and 35045 transitions. [2025-02-05 10:47:46,018 INFO L78 Accepts]: Start accepts. Automaton has 32786 states and 35045 transitions. Word has length 394 [2025-02-05 10:47:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:46,018 INFO L471 AbstractCegarLoop]: Abstraction has 32786 states and 35045 transitions. [2025-02-05 10:47:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 10:47:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32786 states and 35045 transitions. [2025-02-05 10:47:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 10:47:46,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:46,038 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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 10:47:46,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:47:46,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:46,243 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:46,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 508245328, now seen corresponding path program 1 times [2025-02-05 10:47:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035559604] [2025-02-05 10:47:46,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:46,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 10:47:46,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 10:47:46,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:46,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-02-05 10:47:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035559604] [2025-02-05 10:47:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035559604] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806950614] [2025-02-05 10:47:47,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:47,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:47,189 INFO L229 MonitoredProcess]: Starting monitored process 9 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 10:47:47,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:47:47,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 10:47:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 10:47:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:47,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:47:47,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-05 10:47:47,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806950614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086093483] [2025-02-05 10:47:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:47,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:47,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:47,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:47,499 INFO L87 Difference]: Start difference. First operand 32786 states and 35045 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 10:47:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:48,061 INFO L93 Difference]: Finished difference Result 78998 states and 84458 transitions. [2025-02-05 10:47:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:48,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 401 [2025-02-05 10:47:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:48,063 INFO L225 Difference]: With dead ends: 78998 [2025-02-05 10:47:48,063 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:47:48,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:48,092 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 50 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:48,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 317 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:47:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:47:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:47:48,093 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 10:47:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:47:48,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 401 [2025-02-05 10:47:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:48,094 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:47:48,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 10:47:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:47:48,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:47:48,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:47:48,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:47:48,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:47:48,300 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:47:48,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:47:50,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:47:50,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:47:50 BoogieIcfgContainer [2025-02-05 10:47:50,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:47:50,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:47:50,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:47:50,257 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:47:50,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:20" (3/4) ... [2025-02-05 10:47:50,259 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:47:50,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:47:50,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:47:50,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:47:50,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:47:50,418 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:47:50,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:47:50,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:47:50,419 INFO L158 Benchmark]: Toolchain (without parser) took 32753.23ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 107.3MB in the beginning and 885.9MB in the end (delta: -778.5MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-02-05 10:47:50,420 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:47:50,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.70ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 48.4MB in the end (delta: 58.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 10:47:50,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.30ms. Allocated memory is still 142.6MB. Free memory was 48.4MB in the beginning and 97.1MB in the end (delta: -48.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2025-02-05 10:47:50,420 INFO L158 Benchmark]: Boogie Preprocessor took 138.57ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 86.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:47:50,421 INFO L158 Benchmark]: IcfgBuilder took 1634.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.4MB in the beginning and 120.6MB in the end (delta: -34.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-02-05 10:47:50,421 INFO L158 Benchmark]: TraceAbstraction took 30129.72ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 120.6MB in the beginning and 910.8MB in the end (delta: -790.2MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-02-05 10:47:50,421 INFO L158 Benchmark]: Witness Printer took 162.15ms. Allocated memory is still 2.4GB. Free memory was 910.8MB in the beginning and 885.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:47:50,424 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.70ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 48.4MB in the end (delta: 58.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.30ms. Allocated memory is still 142.6MB. Free memory was 48.4MB in the beginning and 97.1MB in the end (delta: -48.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.57ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 86.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1634.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.4MB in the beginning and 120.6MB in the end (delta: -34.2MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30129.72ms. Allocated memory was 176.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 120.6MB in the beginning and 910.8MB in the end (delta: -790.2MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 162.15ms. Allocated memory is still 2.4GB. Free memory was 910.8MB in the beginning and 885.9MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. 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: 1582]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2561 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2561 mSDsluCounter, 3146 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 1502 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9525 IncrementalHoareTripleChecker+Invalid, 11027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1502 mSolverCounterUnsat, 2856 mSDtfsCounter, 9525 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2436 GetRequests, 2395 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37314occurred in iteration=11, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 2533 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 6459 NumberOfCodeBlocks, 6459 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6435 ConstructedInterpolants, 0 QuantifiedInterpolants, 30337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4406 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 3141/3189 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: 1668]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0)) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a11 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:47:50,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE