./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:00:01,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:00:01,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:00:01,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:00:01,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:00:01,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:00:01,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:00:01,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:00:01,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:00:01,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:00:01,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:00:01,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:00:01,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:00:01,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:00:01,444 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:00:01,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:00:01,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:00:01,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:00:01,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:00:01,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:00:01,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:00:01,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:01,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:00:01,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:00:01,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:00:01,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:00:01,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:00:01,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:00:01,447 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a [2025-02-08 00:00:01,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:00:01,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:00:01,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:00:01,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:00:01,704 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:00:01,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-02-08 00:00:02,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5687a5e85/392139f6d7ed4699be692a07c780ef69/FLAG95bbbbbe5 [2025-02-08 00:00:03,412 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:00:03,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2025-02-08 00:00:03,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5687a5e85/392139f6d7ed4699be692a07c780ef69/FLAG95bbbbbe5 [2025-02-08 00:00:03,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5687a5e85/392139f6d7ed4699be692a07c780ef69 [2025-02-08 00:00:03,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:00:03,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:00:03,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:03,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:00:03,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:00:03,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:03" (1/1) ... [2025-02-08 00:00:03,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a92815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:03, skipping insertion in model container [2025-02-08 00:00:03,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:03" (1/1) ... [2025-02-08 00:00:03,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:00:03,790 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2025-02-08 00:00:03,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:03,951 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:00:03,960 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2025-02-08 00:00:04,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:04,072 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:00:04,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04 WrapperNode [2025-02-08 00:00:04,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:04,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:04,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:00:04,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:00:04,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,223 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 650 [2025-02-08 00:00:04,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:04,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:00:04,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:00:04,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:00:04,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,316 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-08 00:00:04,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:00:04,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:00:04,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:00:04,422 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:00:04,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (1/1) ... [2025-02-08 00:00:04,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:04,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:04,471 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-08 00:00:04,485 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-08 00:00:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:00:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:00:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:00:04,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:00:04,691 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:00:04,696 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:00:06,059 INFO L? ?]: Removed 392 outVars from TransFormulas that were not future-live. [2025-02-08 00:00:06,060 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:00:06,183 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:00:06,183 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:00:06,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:06 BoogieIcfgContainer [2025-02-08 00:00:06,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:00:06,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:00:06,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:00:06,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:00:06,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:00:03" (1/3) ... [2025-02-08 00:00:06,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2336fce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:06, skipping insertion in model container [2025-02-08 00:00:06,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:04" (2/3) ... [2025-02-08 00:00:06,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2336fce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:06, skipping insertion in model container [2025-02-08 00:00:06,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:06" (3/3) ... [2025-02-08 00:00:06,201 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_1.c [2025-02-08 00:00:06,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:00:06,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2004_1.c that has 1 procedures, 192 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:00:06,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:00:06,335 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;@2b136cde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:00:06,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:00:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 190 states have (on average 1.5) internal successors, (285), 191 states have internal predecessors, (285), 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-08 00:00:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:00:06,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:06,353 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] [2025-02-08 00:00:06,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1620371225, now seen corresponding path program 1 times [2025-02-08 00:00:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114190895] [2025-02-08 00:00:06,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:06,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:00:06,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:00:06,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:06,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:07,041 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-08 00:00:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114190895] [2025-02-08 00:00:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114190895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:07,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:07,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383983434] [2025-02-08 00:00:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:07,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:07,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:07,071 INFO L87 Difference]: Start difference. First operand has 192 states, 190 states have (on average 1.5) internal successors, (285), 191 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-08 00:00:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:07,297 INFO L93 Difference]: Finished difference Result 347 states and 517 transitions. [2025-02-08 00:00:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-02-08 00:00:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:07,305 INFO L225 Difference]: With dead ends: 347 [2025-02-08 00:00:07,306 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 00:00:07,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:07,311 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:07,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 00:00:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-08 00:00:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.486910994764398) internal successors, (284), 191 states have internal predecessors, (284), 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-08 00:00:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2025-02-08 00:00:07,348 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 26 [2025-02-08 00:00:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:07,349 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2025-02-08 00:00:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-08 00:00:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2025-02-08 00:00:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 00:00:07,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:07,350 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] [2025-02-08 00:00:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:00:07,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1312778965, now seen corresponding path program 1 times [2025-02-08 00:00:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336277111] [2025-02-08 00:00:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 00:00:07,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:00:07,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:07,503 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-08 00:00:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336277111] [2025-02-08 00:00:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336277111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685864472] [2025-02-08 00:00:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:07,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:07,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:07,506 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 00:00:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:07,651 INFO L93 Difference]: Finished difference Result 349 states and 516 transitions. [2025-02-08 00:00:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-02-08 00:00:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:07,652 INFO L225 Difference]: With dead ends: 349 [2025-02-08 00:00:07,652 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 00:00:07,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:07,656 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:07,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 00:00:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 00:00:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 193 states have internal predecessors, (286), 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-08 00:00:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2025-02-08 00:00:07,671 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 27 [2025-02-08 00:00:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2025-02-08 00:00:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 00:00:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2025-02-08 00:00:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 00:00:07,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:07,673 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] [2025-02-08 00:00:07,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:00:07,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:07,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -322015582, now seen corresponding path program 1 times [2025-02-08 00:00:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:07,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596837458] [2025-02-08 00:00:07,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:07,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:00:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:00:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:07,901 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-08 00:00:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596837458] [2025-02-08 00:00:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596837458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970234444] [2025-02-08 00:00:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:07,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:07,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:07,904 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-08 00:00:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:08,181 INFO L93 Difference]: Finished difference Result 482 states and 711 transitions. [2025-02-08 00:00:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:08,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-02-08 00:00:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:08,184 INFO L225 Difference]: With dead ends: 482 [2025-02-08 00:00:08,184 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 00:00:08,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:08,185 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 649 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:08,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 672 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 00:00:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 196. [2025-02-08 00:00:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.476923076923077) internal successors, (288), 195 states have internal predecessors, (288), 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-08 00:00:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2025-02-08 00:00:08,204 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 28 [2025-02-08 00:00:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2025-02-08 00:00:08,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-08 00:00:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2025-02-08 00:00:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 00:00:08,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:08,206 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:00:08,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2049137952, now seen corresponding path program 1 times [2025-02-08 00:00:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307016046] [2025-02-08 00:00:08,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:08,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 00:00:08,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 00:00:08,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:08,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307016046] [2025-02-08 00:00:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307016046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981187799] [2025-02-08 00:00:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:09,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:09,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:09,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:09,384 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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-08 00:00:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:09,681 INFO L93 Difference]: Finished difference Result 474 states and 698 transitions. [2025-02-08 00:00:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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 105 [2025-02-08 00:00:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:09,683 INFO L225 Difference]: With dead ends: 474 [2025-02-08 00:00:09,683 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 00:00:09,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:09,684 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 597 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:09,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 665 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 00:00:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 243. [2025-02-08 00:00:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.4669421487603307) internal successors, (355), 242 states have internal predecessors, (355), 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-08 00:00:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 355 transitions. [2025-02-08 00:00:09,699 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 355 transitions. Word has length 105 [2025-02-08 00:00:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 355 transitions. [2025-02-08 00:00:09,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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-08 00:00:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 355 transitions. [2025-02-08 00:00:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 00:00:09,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:09,729 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:00:09,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 377778902, now seen corresponding path program 1 times [2025-02-08 00:00:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738142667] [2025-02-08 00:00:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:09,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 00:00:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 00:00:10,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:10,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:10,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738142667] [2025-02-08 00:00:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738142667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:10,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:10,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999293922] [2025-02-08 00:00:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:10,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:10,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:10,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:10,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:10,528 INFO L87 Difference]: Start difference. First operand 243 states and 355 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 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-08 00:00:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:10,733 INFO L93 Difference]: Finished difference Result 474 states and 696 transitions. [2025-02-08 00:00:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2025-02-08 00:00:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:10,735 INFO L225 Difference]: With dead ends: 474 [2025-02-08 00:00:10,736 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 00:00:10,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:10,737 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 575 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:10,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 664 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 00:00:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2025-02-08 00:00:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.4657039711191335) internal successors, (406), 277 states have internal predecessors, (406), 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-08 00:00:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 406 transitions. [2025-02-08 00:00:10,751 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 406 transitions. Word has length 107 [2025-02-08 00:00:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:10,751 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 406 transitions. [2025-02-08 00:00:10,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 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-08 00:00:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 406 transitions. [2025-02-08 00:00:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 00:00:10,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:10,752 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:00:10,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -156017539, now seen corresponding path program 1 times [2025-02-08 00:00:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609451718] [2025-02-08 00:00:10,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 00:00:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 00:00:10,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609451718] [2025-02-08 00:00:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609451718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722972362] [2025-02-08 00:00:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:11,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:11,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:11,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:11,271 INFO L87 Difference]: Start difference. First operand 278 states and 406 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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-08 00:00:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:11,428 INFO L93 Difference]: Finished difference Result 532 states and 779 transitions. [2025-02-08 00:00:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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 108 [2025-02-08 00:00:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:11,430 INFO L225 Difference]: With dead ends: 532 [2025-02-08 00:00:11,430 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 00:00:11,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:11,431 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 603 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:11,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 671 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 00:00:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2025-02-08 00:00:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.4584837545126355) internal successors, (404), 277 states have internal predecessors, (404), 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-08 00:00:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2025-02-08 00:00:11,440 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 108 [2025-02-08 00:00:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:11,440 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2025-02-08 00:00:11,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 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-08 00:00:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2025-02-08 00:00:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-08 00:00:11,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:11,442 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:00:11,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:11,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1003082192, now seen corresponding path program 1 times [2025-02-08 00:00:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050036088] [2025-02-08 00:00:11,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 00:00:11,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 00:00:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050036088] [2025-02-08 00:00:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050036088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113648017] [2025-02-08 00:00:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:11,997 INFO L87 Difference]: Start difference. First operand 278 states and 404 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-08 00:00:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:12,202 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2025-02-08 00:00:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2025-02-08 00:00:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:12,203 INFO L225 Difference]: With dead ends: 474 [2025-02-08 00:00:12,203 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 00:00:12,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:12,204 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 556 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:12,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 664 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 00:00:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 298. [2025-02-08 00:00:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4579124579124578) internal successors, (433), 297 states have internal predecessors, (433), 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-08 00:00:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 433 transitions. [2025-02-08 00:00:12,219 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 433 transitions. Word has length 110 [2025-02-08 00:00:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:12,219 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 433 transitions. [2025-02-08 00:00:12,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 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-08 00:00:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 433 transitions. [2025-02-08 00:00:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-08 00:00:12,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:12,220 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:12,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:00:12,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:12,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1939766500, now seen corresponding path program 1 times [2025-02-08 00:00:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856541871] [2025-02-08 00:00:12,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:12,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 00:00:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 00:00:12,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856541871] [2025-02-08 00:00:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856541871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188563215] [2025-02-08 00:00:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:12,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:12,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:12,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:12,787 INFO L87 Difference]: Start difference. First operand 298 states and 433 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 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-08 00:00:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:13,003 INFO L93 Difference]: Finished difference Result 482 states and 704 transitions. [2025-02-08 00:00:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 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 111 [2025-02-08 00:00:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:13,006 INFO L225 Difference]: With dead ends: 482 [2025-02-08 00:00:13,007 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 00:00:13,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:13,009 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 576 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:13,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 935 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 00:00:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 301. [2025-02-08 00:00:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4566666666666668) internal successors, (437), 300 states have internal predecessors, (437), 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-08 00:00:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2025-02-08 00:00:13,020 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 111 [2025-02-08 00:00:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:13,022 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2025-02-08 00:00:13,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 states have internal predecessors, (111), 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-08 00:00:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2025-02-08 00:00:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 00:00:13,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:13,023 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:13,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:00:13,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1532992427, now seen corresponding path program 1 times [2025-02-08 00:00:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159528874] [2025-02-08 00:00:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:13,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 00:00:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 00:00:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159528874] [2025-02-08 00:00:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159528874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963554539] [2025-02-08 00:00:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:13,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:13,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:13,513 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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-08 00:00:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:13,682 INFO L93 Difference]: Finished difference Result 479 states and 699 transitions. [2025-02-08 00:00:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2025-02-08 00:00:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:13,684 INFO L225 Difference]: With dead ends: 479 [2025-02-08 00:00:13,684 INFO L226 Difference]: Without dead ends: 322 [2025-02-08 00:00:13,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:13,686 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 548 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:13,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 661 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-08 00:00:13,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2025-02-08 00:00:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.4545454545454546) internal successors, (464), 319 states have internal predecessors, (464), 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-08 00:00:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 464 transitions. [2025-02-08 00:00:13,696 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 464 transitions. Word has length 112 [2025-02-08 00:00:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:13,696 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 464 transitions. [2025-02-08 00:00:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 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-08 00:00:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 464 transitions. [2025-02-08 00:00:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-08 00:00:13,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:13,697 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:13,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:00:13,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:13,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 613896912, now seen corresponding path program 1 times [2025-02-08 00:00:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588086352] [2025-02-08 00:00:13,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 00:00:13,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 00:00:13,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:13,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588086352] [2025-02-08 00:00:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588086352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230123150] [2025-02-08 00:00:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:14,251 INFO L87 Difference]: Start difference. First operand 320 states and 464 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 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-08 00:00:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:14,488 INFO L93 Difference]: Finished difference Result 484 states and 705 transitions. [2025-02-08 00:00:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 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 113 [2025-02-08 00:00:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:14,490 INFO L225 Difference]: With dead ends: 484 [2025-02-08 00:00:14,490 INFO L226 Difference]: Without dead ends: 327 [2025-02-08 00:00:14,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:14,491 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 556 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:14,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1094 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-08 00:00:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2025-02-08 00:00:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.453416149068323) internal successors, (468), 322 states have internal predecessors, (468), 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-08 00:00:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 468 transitions. [2025-02-08 00:00:14,503 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 468 transitions. Word has length 113 [2025-02-08 00:00:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 468 transitions. [2025-02-08 00:00:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 6 states have internal predecessors, (113), 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-08 00:00:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 468 transitions. [2025-02-08 00:00:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 00:00:14,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:14,505 INFO L218 NwaCegarLoop]: trace histogram [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-08 00:00:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:00:14,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -810012934, now seen corresponding path program 1 times [2025-02-08 00:00:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927240369] [2025-02-08 00:00:14,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:14,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 00:00:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 00:00:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927240369] [2025-02-08 00:00:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927240369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:14,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170924682] [2025-02-08 00:00:14,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:14,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:14,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:14,907 INFO L87 Difference]: Start difference. First operand 323 states and 468 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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-08 00:00:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:15,140 INFO L93 Difference]: Finished difference Result 490 states and 713 transitions. [2025-02-08 00:00:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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 114 [2025-02-08 00:00:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:15,142 INFO L225 Difference]: With dead ends: 490 [2025-02-08 00:00:15,142 INFO L226 Difference]: Without dead ends: 333 [2025-02-08 00:00:15,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:15,142 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 565 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:15,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1099 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-08 00:00:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2025-02-08 00:00:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.451219512195122) internal successors, (476), 328 states have internal predecessors, (476), 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-08 00:00:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 476 transitions. [2025-02-08 00:00:15,155 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 476 transitions. Word has length 114 [2025-02-08 00:00:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:15,155 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 476 transitions. [2025-02-08 00:00:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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-08 00:00:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 476 transitions. [2025-02-08 00:00:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 00:00:15,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:15,156 INFO L218 NwaCegarLoop]: trace histogram [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-08 00:00:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:00:15,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 100863173, now seen corresponding path program 1 times [2025-02-08 00:00:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423904816] [2025-02-08 00:00:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:15,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 00:00:15,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 00:00:15,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:15,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423904816] [2025-02-08 00:00:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423904816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109754000] [2025-02-08 00:00:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:15,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:15,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:15,551 INFO L87 Difference]: Start difference. First operand 329 states and 476 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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-08 00:00:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:15,718 INFO L93 Difference]: Finished difference Result 511 states and 742 transitions. [2025-02-08 00:00:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2025-02-08 00:00:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:15,720 INFO L225 Difference]: With dead ends: 511 [2025-02-08 00:00:15,720 INFO L226 Difference]: Without dead ends: 327 [2025-02-08 00:00:15,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:15,722 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 553 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 665 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-08 00:00:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-02-08 00:00:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.450920245398773) internal successors, (473), 326 states have internal predecessors, (473), 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-08 00:00:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 473 transitions. [2025-02-08 00:00:15,728 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 473 transitions. Word has length 114 [2025-02-08 00:00:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:15,728 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 473 transitions. [2025-02-08 00:00:15,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 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-08 00:00:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 473 transitions. [2025-02-08 00:00:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 00:00:15,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:15,732 INFO L218 NwaCegarLoop]: trace histogram [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-08 00:00:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:00:15,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -944907810, now seen corresponding path program 1 times [2025-02-08 00:00:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557282123] [2025-02-08 00:00:15,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:15,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 00:00:15,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 00:00:15,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:15,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557282123] [2025-02-08 00:00:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557282123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966718517] [2025-02-08 00:00:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:16,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:16,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:16,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:16,195 INFO L87 Difference]: Start difference. First operand 327 states and 473 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 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-08 00:00:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:16,363 INFO L93 Difference]: Finished difference Result 531 states and 770 transitions. [2025-02-08 00:00:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 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 114 [2025-02-08 00:00:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:16,365 INFO L225 Difference]: With dead ends: 531 [2025-02-08 00:00:16,365 INFO L226 Difference]: Without dead ends: 327 [2025-02-08 00:00:16,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:16,368 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 564 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 665 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-08 00:00:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-02-08 00:00:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.4478527607361964) internal successors, (472), 326 states have internal predecessors, (472), 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-08 00:00:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 472 transitions. [2025-02-08 00:00:16,376 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 472 transitions. Word has length 114 [2025-02-08 00:00:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 472 transitions. [2025-02-08 00:00:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 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-08 00:00:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 472 transitions. [2025-02-08 00:00:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 00:00:16,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:16,378 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:16,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:00:16,378 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1908987897, now seen corresponding path program 1 times [2025-02-08 00:00:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002143318] [2025-02-08 00:00:16,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 00:00:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 00:00:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:17,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002143318] [2025-02-08 00:00:17,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002143318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:17,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847362728] [2025-02-08 00:00:17,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:17,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:17,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:17,234 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-08 00:00:17,236 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-08 00:00:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 00:00:17,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 00:00:17,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:17,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:17,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 00:00:17,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:18,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847362728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:00:19,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:00:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 26 [2025-02-08 00:00:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147094489] [2025-02-08 00:00:19,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:00:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:00:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:19,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:00:19,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:00:19,059 INFO L87 Difference]: Start difference. First operand 327 states and 472 transitions. Second operand has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 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-08 00:00:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:20,141 INFO L93 Difference]: Finished difference Result 875 states and 1265 transitions. [2025-02-08 00:00:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:00:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 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 115 [2025-02-08 00:00:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:20,144 INFO L225 Difference]: With dead ends: 875 [2025-02-08 00:00:20,144 INFO L226 Difference]: Without dead ends: 598 [2025-02-08 00:00:20,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:00:20,147 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1320 mSDsluCounter, 5227 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 5563 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 5563 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:00:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-02-08 00:00:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 469. [2025-02-08 00:00:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.435897435897436) internal successors, (672), 468 states have internal predecessors, (672), 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-08 00:00:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 672 transitions. [2025-02-08 00:00:20,156 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 672 transitions. Word has length 115 [2025-02-08 00:00:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:20,156 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 672 transitions. [2025-02-08 00:00:20,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.407407407407407) internal successors, (335), 26 states have internal predecessors, (335), 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-08 00:00:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 672 transitions. [2025-02-08 00:00:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 00:00:20,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:20,158 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:20,167 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-08 00:00:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 00:00:20,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 306971378, now seen corresponding path program 1 times [2025-02-08 00:00:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977993709] [2025-02-08 00:00:20,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:20,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 00:00:20,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 00:00:20,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:20,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977993709] [2025-02-08 00:00:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977993709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423606077] [2025-02-08 00:00:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:20,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:20,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:20,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:20,555 INFO L87 Difference]: Start difference. First operand 469 states and 672 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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-08 00:00:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:20,680 INFO L93 Difference]: Finished difference Result 747 states and 1073 transitions. [2025-02-08 00:00:20,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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 116 [2025-02-08 00:00:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:20,682 INFO L225 Difference]: With dead ends: 747 [2025-02-08 00:00:20,682 INFO L226 Difference]: Without dead ends: 468 [2025-02-08 00:00:20,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:20,685 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 615 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:20,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 673 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-08 00:00:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2025-02-08 00:00:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.4322580645161291) internal successors, (666), 465 states have internal predecessors, (666), 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-08 00:00:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 666 transitions. [2025-02-08 00:00:20,695 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 666 transitions. Word has length 116 [2025-02-08 00:00:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:20,695 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 666 transitions. [2025-02-08 00:00:20,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 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-08 00:00:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 666 transitions. [2025-02-08 00:00:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 00:00:20,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:20,696 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:00:20,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:00:20,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:20,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash -270280147, now seen corresponding path program 1 times [2025-02-08 00:00:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346311621] [2025-02-08 00:00:20,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:20,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 00:00:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 00:00:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346311621] [2025-02-08 00:00:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346311621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:20,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042141903] [2025-02-08 00:00:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:20,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:20,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:20,923 INFO L87 Difference]: Start difference. First operand 466 states and 666 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 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-08 00:00:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:21,053 INFO L93 Difference]: Finished difference Result 623 states and 897 transitions. [2025-02-08 00:00:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:21,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 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 116 [2025-02-08 00:00:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:21,054 INFO L225 Difference]: With dead ends: 623 [2025-02-08 00:00:21,054 INFO L226 Difference]: Without dead ends: 343 [2025-02-08 00:00:21,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:21,056 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 597 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:21,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 669 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-08 00:00:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-02-08 00:00:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.4385964912280702) internal successors, (492), 342 states have internal predecessors, (492), 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-08 00:00:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 492 transitions. [2025-02-08 00:00:21,064 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 492 transitions. Word has length 116 [2025-02-08 00:00:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:21,064 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 492 transitions. [2025-02-08 00:00:21,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 5 states have internal predecessors, (116), 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-08 00:00:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 492 transitions. [2025-02-08 00:00:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-08 00:00:21,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:21,066 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:00:21,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:00:21,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 894849321, now seen corresponding path program 1 times [2025-02-08 00:00:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836347039] [2025-02-08 00:00:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:21,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 00:00:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 00:00:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 00:00:23,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:23,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836347039] [2025-02-08 00:00:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836347039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:23,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643368315] [2025-02-08 00:00:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:23,509 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-08 00:00:23,517 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-08 00:00:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-08 00:00:23,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-08 00:00:23,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:23,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:23,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-08 00:00:23,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:25,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:28,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643368315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:00:28,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:00:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 19] total 48 [2025-02-08 00:00:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419501546] [2025-02-08 00:00:28,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:00:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 00:00:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:28,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 00:00:28,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1983, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 00:00:28,215 INFO L87 Difference]: Start difference. First operand 343 states and 492 transitions. Second operand has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 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-08 00:00:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:42,065 INFO L93 Difference]: Finished difference Result 4615 states and 6775 transitions. [2025-02-08 00:00:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2025-02-08 00:00:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 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 192 [2025-02-08 00:00:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:42,107 INFO L225 Difference]: With dead ends: 4615 [2025-02-08 00:00:42,107 INFO L226 Difference]: Without dead ends: 4381 [2025-02-08 00:00:42,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24804 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=8372, Invalid=53878, Unknown=0, NotChecked=0, Total=62250 [2025-02-08 00:00:42,148 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 20792 mSDsluCounter, 9910 mSDsCounter, 0 mSdLazyCounter, 5942 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20792 SdHoareTripleChecker+Valid, 10299 SdHoareTripleChecker+Invalid, 6034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 5942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:42,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20792 Valid, 10299 Invalid, 6034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 5942 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 00:00:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2025-02-08 00:00:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 1755. [2025-02-08 00:00:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.4498289623717218) internal successors, (2543), 1754 states have internal predecessors, (2543), 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-08 00:00:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2543 transitions. [2025-02-08 00:00:42,267 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2543 transitions. Word has length 192 [2025-02-08 00:00:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:42,267 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2543 transitions. [2025-02-08 00:00:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 11.291666666666666) internal successors, (542), 48 states have internal predecessors, (542), 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-08 00:00:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2543 transitions. [2025-02-08 00:00:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 00:00:42,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:42,279 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:00:42,296 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-08 00:00:42,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 00:00:42,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:42,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -961088197, now seen corresponding path program 1 times [2025-02-08 00:00:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572763129] [2025-02-08 00:00:42,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:43,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:43,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:43,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572763129] [2025-02-08 00:00:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572763129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481993111] [2025-02-08 00:00:45,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:45,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:45,614 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-08 00:00:45,616 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-08 00:00:45,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:46,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:46,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:46,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-08 00:00:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 00:00:46,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:00:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481993111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:00:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2025-02-08 00:00:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092219420] [2025-02-08 00:00:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:46,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 00:00:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:46,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 00:00:46,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-02-08 00:00:46,652 INFO L87 Difference]: Start difference. First operand 1755 states and 2543 transitions. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 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-08 00:00:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:47,394 INFO L93 Difference]: Finished difference Result 3147 states and 4608 transitions. [2025-02-08 00:00:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 00:00:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 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-08 00:00:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:47,413 INFO L225 Difference]: With dead ends: 3147 [2025-02-08 00:00:47,413 INFO L226 Difference]: Without dead ends: 2649 [2025-02-08 00:00:47,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:00:47,415 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 359 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:47,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2960 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:00:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-08 00:00:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2163. [2025-02-08 00:00:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4574468085106382) internal successors, (3151), 2162 states have internal predecessors, (3151), 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-08 00:00:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3151 transitions. [2025-02-08 00:00:47,488 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3151 transitions. Word has length 194 [2025-02-08 00:00:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:47,488 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3151 transitions. [2025-02-08 00:00:47,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 states have internal predecessors, (169), 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-08 00:00:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3151 transitions. [2025-02-08 00:00:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 00:00:47,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:47,496 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:00:47,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 00:00:47,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:47,697 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:47,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1263492409, now seen corresponding path program 1 times [2025-02-08 00:00:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968432260] [2025-02-08 00:00:47,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:47,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:48,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:48,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:48,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 00:00:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968432260] [2025-02-08 00:00:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968432260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933941520] [2025-02-08 00:00:49,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:49,475 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-08 00:00:49,477 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-08 00:00:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:49,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:49,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:50,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-02-08 00:00:50,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:50,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 00:00:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933941520] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:00:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9, 15] total 34 [2025-02-08 00:00:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965723405] [2025-02-08 00:00:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:00:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:51,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:00:51,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 00:00:51,641 INFO L87 Difference]: Start difference. First operand 2163 states and 3151 transitions. Second operand has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 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-08 00:00:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:52,867 INFO L93 Difference]: Finished difference Result 6425 states and 9494 transitions. [2025-02-08 00:00:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:00:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 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-08 00:00:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:52,882 INFO L225 Difference]: With dead ends: 6425 [2025-02-08 00:00:52,883 INFO L226 Difference]: Without dead ends: 4095 [2025-02-08 00:00:52,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 00:00:52,894 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 1317 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:52,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2560 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:00:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-02-08 00:00:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2269. [2025-02-08 00:00:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2268 states have (on average 1.4598765432098766) internal successors, (3311), 2268 states have internal predecessors, (3311), 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-08 00:00:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 3311 transitions. [2025-02-08 00:00:52,956 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 3311 transitions. Word has length 194 [2025-02-08 00:00:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:52,957 INFO L471 AbstractCegarLoop]: Abstraction has 2269 states and 3311 transitions. [2025-02-08 00:00:52,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.0) internal successors, (180), 12 states have internal predecessors, (180), 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-08 00:00:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 3311 transitions. [2025-02-08 00:00:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 00:00:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:52,961 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:00:52,971 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-08 00:00:53,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:53,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:53,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1685398065, now seen corresponding path program 1 times [2025-02-08 00:00:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:53,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298742004] [2025-02-08 00:00:53,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:53,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:53,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 00:00:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298742004] [2025-02-08 00:00:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298742004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770264825] [2025-02-08 00:00:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:54,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:54,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:54,793 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-08 00:00:54,794 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-08 00:00:55,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:55,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:55,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:55,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:55,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 00:00:55,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:55,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 00:00:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770264825] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:00:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 22 [2025-02-08 00:00:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081323155] [2025-02-08 00:00:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:55,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:00:55,894 INFO L87 Difference]: Start difference. First operand 2269 states and 3311 transitions. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-08 00:00:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:56,157 INFO L93 Difference]: Finished difference Result 5160 states and 7605 transitions. [2025-02-08 00:00:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:00:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-08 00:00:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:56,165 INFO L225 Difference]: With dead ends: 5160 [2025-02-08 00:00:56,165 INFO L226 Difference]: Without dead ends: 3001 [2025-02-08 00:00:56,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:00:56,175 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 512 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:56,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1197 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-02-08 00:00:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2301. [2025-02-08 00:00:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2300 states have (on average 1.4573913043478262) internal successors, (3352), 2300 states have internal predecessors, (3352), 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-08 00:00:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3352 transitions. [2025-02-08 00:00:56,239 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3352 transitions. Word has length 194 [2025-02-08 00:00:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:56,239 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 3352 transitions. [2025-02-08 00:00:56,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-08 00:00:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3352 transitions. [2025-02-08 00:00:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 00:00:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:56,251 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:00:56,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 00:00:56,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:56,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:56,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1522933567, now seen corresponding path program 1 times [2025-02-08 00:00:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396629426] [2025-02-08 00:00:56,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:56,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:56,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:56,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396629426] [2025-02-08 00:00:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396629426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372853944] [2025-02-08 00:00:58,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:58,096 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-08 00:00:58,114 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-08 00:00:58,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:00:58,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:00:58,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:58,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 00:00:58,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:59,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372853944] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:01,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:01:01,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 13] total 29 [2025-02-08 00:01:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675845991] [2025-02-08 00:01:01,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:01,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 00:01:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:01,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 00:01:01,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:01:01,125 INFO L87 Difference]: Start difference. First operand 2301 states and 3352 transitions. Second operand has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 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-08 00:01:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:02,738 INFO L93 Difference]: Finished difference Result 3902 states and 5705 transitions. [2025-02-08 00:01:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 00:01:02,739 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 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-08 00:01:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:02,747 INFO L225 Difference]: With dead ends: 3902 [2025-02-08 00:01:02,747 INFO L226 Difference]: Without dead ends: 3049 [2025-02-08 00:01:02,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1814, Unknown=0, NotChecked=0, Total=2070 [2025-02-08 00:01:02,756 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 663 mSDsluCounter, 8205 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 8666 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:02,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 8666 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3680 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:01:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2025-02-08 00:01:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2816. [2025-02-08 00:01:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2815 states have (on average 1.450088809946714) internal successors, (4082), 2815 states have internal predecessors, (4082), 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-08 00:01:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 4082 transitions. [2025-02-08 00:01:02,835 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 4082 transitions. Word has length 194 [2025-02-08 00:01:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:02,835 INFO L471 AbstractCegarLoop]: Abstraction has 2816 states and 4082 transitions. [2025-02-08 00:01:02,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 17.633333333333333) internal successors, (529), 29 states have internal predecessors, (529), 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-08 00:01:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 4082 transitions. [2025-02-08 00:01:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:01:02,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:02,847 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:02,859 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-08 00:01:03,048 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,SelfDestructingSolverStorable20 [2025-02-08 00:01:03,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1905056239, now seen corresponding path program 1 times [2025-02-08 00:01:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831704945] [2025-02-08 00:01:03,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:03,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:03,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:03,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:03,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 00:01:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831704945] [2025-02-08 00:01:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831704945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143542621] [2025-02-08 00:01:05,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:05,046 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-08 00:01:05,047 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-08 00:01:05,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:05,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:05,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:05,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-08 00:01:05,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 00:01:05,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:01:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143542621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:05,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:01:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 26 [2025-02-08 00:01:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276390725] [2025-02-08 00:01:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:05,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:01:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:05,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:01:05,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-02-08 00:01:05,947 INFO L87 Difference]: Start difference. First operand 2816 states and 4082 transitions. Second operand has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:06,455 INFO L93 Difference]: Finished difference Result 6581 states and 9652 transitions. [2025-02-08 00:01:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 00:01:06,458 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-08 00:01:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:06,469 INFO L225 Difference]: With dead ends: 6581 [2025-02-08 00:01:06,469 INFO L226 Difference]: Without dead ends: 4777 [2025-02-08 00:01:06,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-02-08 00:01:06,473 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 180 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:06,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2906 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2025-02-08 00:01:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4577. [2025-02-08 00:01:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.46131993006993) internal successors, (6687), 4576 states have internal predecessors, (6687), 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-08 00:01:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6687 transitions. [2025-02-08 00:01:06,514 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6687 transitions. Word has length 195 [2025-02-08 00:01:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:06,515 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 6687 transitions. [2025-02-08 00:01:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.533333333333333) internal successors, (188), 15 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6687 transitions. [2025-02-08 00:01:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:01:06,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:06,521 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:06,532 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-08 00:01:06,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:06,721 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:06,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1862912567, now seen corresponding path program 1 times [2025-02-08 00:01:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313198783] [2025-02-08 00:01:06,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:07,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:07,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 43 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 00:01:07,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313198783] [2025-02-08 00:01:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313198783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711551344] [2025-02-08 00:01:07,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:07,776 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-08 00:01:07,778 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-08 00:01:08,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:08,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:08,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:08,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 00:01:08,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 42 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:08,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 00:01:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711551344] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:09,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:09,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 22 [2025-02-08 00:01:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797793906] [2025-02-08 00:01:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:09,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:09,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:01:09,057 INFO L87 Difference]: Start difference. First operand 4577 states and 6687 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 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-08 00:01:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:09,316 INFO L93 Difference]: Finished difference Result 13340 states and 19589 transitions. [2025-02-08 00:01:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:01:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 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 195 [2025-02-08 00:01:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:09,326 INFO L225 Difference]: With dead ends: 13340 [2025-02-08 00:01:09,326 INFO L226 Difference]: Without dead ends: 5576 [2025-02-08 00:01:09,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:01:09,333 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 523 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:09,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 965 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:01:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2025-02-08 00:01:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5224. [2025-02-08 00:01:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5224 states, 5223 states have (on average 1.4577828834003446) internal successors, (7614), 5223 states have internal predecessors, (7614), 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-08 00:01:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7614 transitions. [2025-02-08 00:01:09,386 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7614 transitions. Word has length 195 [2025-02-08 00:01:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:09,386 INFO L471 AbstractCegarLoop]: Abstraction has 5224 states and 7614 transitions. [2025-02-08 00:01:09,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 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-08 00:01:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7614 transitions. [2025-02-08 00:01:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:01:09,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:09,402 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 00:01:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:09,607 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1318395694, now seen corresponding path program 1 times [2025-02-08 00:01:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650266462] [2025-02-08 00:01:09,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:09,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:09,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:09,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:09,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 00:01:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650266462] [2025-02-08 00:01:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650266462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679041987] [2025-02-08 00:01:10,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:10,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 00:01:11,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:11,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:11,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-02-08 00:01:11,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:12,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 00:01:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679041987] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [11, 19] total 46 [2025-02-08 00:01:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446585265] [2025-02-08 00:01:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 00:01:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 00:01:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2025-02-08 00:01:12,869 INFO L87 Difference]: Start difference. First operand 5224 states and 7614 transitions. Second operand has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 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-08 00:01:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:13,960 INFO L93 Difference]: Finished difference Result 16277 states and 23892 transitions. [2025-02-08 00:01:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 00:01:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 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 195 [2025-02-08 00:01:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:13,973 INFO L225 Difference]: With dead ends: 16277 [2025-02-08 00:01:13,976 INFO L226 Difference]: Without dead ends: 7991 [2025-02-08 00:01:13,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=412, Invalid=2780, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 00:01:13,992 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 2273 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2273 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:13,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2273 Valid, 3300 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:01:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2025-02-08 00:01:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 5240. [2025-02-08 00:01:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5239 states have (on average 1.455621301775148) internal successors, (7626), 5239 states have internal predecessors, (7626), 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-08 00:01:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7626 transitions. [2025-02-08 00:01:14,119 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7626 transitions. Word has length 195 [2025-02-08 00:01:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:14,121 INFO L471 AbstractCegarLoop]: Abstraction has 5240 states and 7626 transitions. [2025-02-08 00:01:14,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.947368421052632) internal successors, (189), 19 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-08 00:01:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7626 transitions. [2025-02-08 00:01:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:01:14,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:14,127 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:14,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 00:01:14,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:14,331 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1039996712, now seen corresponding path program 1 times [2025-02-08 00:01:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111295337] [2025-02-08 00:01:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:14,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:14,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:14,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 00:01:16,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:16,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111295337] [2025-02-08 00:01:16,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111295337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:16,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589646895] [2025-02-08 00:01:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:16,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:16,420 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:16,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 00:01:16,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:16,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:16,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:16,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:16,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-08 00:01:16,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:17,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589646895] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:18,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:01:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-02-08 00:01:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458141110] [2025-02-08 00:01:18,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 00:01:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:18,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 00:01:18,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-02-08 00:01:18,269 INFO L87 Difference]: Start difference. First operand 5240 states and 7626 transitions. Second operand has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 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-08 00:01:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:20,642 INFO L93 Difference]: Finished difference Result 20646 states and 30090 transitions. [2025-02-08 00:01:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-08 00:01:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 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 195 [2025-02-08 00:01:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:20,668 INFO L225 Difference]: With dead ends: 20646 [2025-02-08 00:01:20,668 INFO L226 Difference]: Without dead ends: 17957 [2025-02-08 00:01:20,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1103, Invalid=6207, Unknown=0, NotChecked=0, Total=7310 [2025-02-08 00:01:20,676 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 9471 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9471 SdHoareTripleChecker+Valid, 4595 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:20,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9471 Valid, 4595 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:01:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17957 states. [2025-02-08 00:01:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17957 to 10108. [2025-02-08 00:01:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10108 states, 10107 states have (on average 1.4511724547343425) internal successors, (14667), 10107 states have internal predecessors, (14667), 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-08 00:01:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 14667 transitions. [2025-02-08 00:01:20,812 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 14667 transitions. Word has length 195 [2025-02-08 00:01:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:20,812 INFO L471 AbstractCegarLoop]: Abstraction has 10108 states and 14667 transitions. [2025-02-08 00:01:20,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 19.785714285714285) internal successors, (554), 27 states have internal predecessors, (554), 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-08 00:01:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 14667 transitions. [2025-02-08 00:01:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:01:20,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:20,825 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:20,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 00:01:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 00:01:21,029 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1173841890, now seen corresponding path program 1 times [2025-02-08 00:01:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573443614] [2025-02-08 00:01:21,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:21,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:21,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:21,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:21,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 00:01:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:23,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573443614] [2025-02-08 00:01:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573443614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:23,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840543992] [2025-02-08 00:01:23,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:23,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:23,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:23,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:23,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 00:01:23,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:01:23,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:01:23,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:23,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 00:01:23,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-08 00:01:23,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:01:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840543992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:01:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-02-08 00:01:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843856017] [2025-02-08 00:01:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:23,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:01:23,791 INFO L87 Difference]: Start difference. First operand 10108 states and 14667 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 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-08 00:01:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:24,023 INFO L93 Difference]: Finished difference Result 14104 states and 20544 transitions. [2025-02-08 00:01:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:01:24,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 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 195 [2025-02-08 00:01:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:24,036 INFO L225 Difference]: With dead ends: 14104 [2025-02-08 00:01:24,036 INFO L226 Difference]: Without dead ends: 9576 [2025-02-08 00:01:24,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-02-08 00:01:24,043 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 570 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:24,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 568 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:01:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2025-02-08 00:01:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 9576. [2025-02-08 00:01:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9576 states, 9575 states have (on average 1.4538903394255875) internal successors, (13921), 9575 states have internal predecessors, (13921), 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-08 00:01:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 13921 transitions. [2025-02-08 00:01:24,129 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 13921 transitions. Word has length 195 [2025-02-08 00:01:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:24,129 INFO L471 AbstractCegarLoop]: Abstraction has 9576 states and 13921 transitions. [2025-02-08 00:01:24,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 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-08 00:01:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 13921 transitions. [2025-02-08 00:01:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-08 00:01:24,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:24,138 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-08 00:01:24,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 00:01:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 00:01:24,342 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:24,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1945267136, now seen corresponding path program 1 times [2025-02-08 00:01:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:24,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851998397] [2025-02-08 00:01:24,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:24,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 00:01:24,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 00:01:24,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851998397] [2025-02-08 00:01:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851998397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368651622] [2025-02-08 00:01:26,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:26,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:26,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:26,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 00:01:26,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 00:01:27,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 00:01:27,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:27,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 00:01:27,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:27,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:28,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368651622] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:28,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:01:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 31 [2025-02-08 00:01:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60224476] [2025-02-08 00:01:28,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:28,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 00:01:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:28,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 00:01:28,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:01:28,864 INFO L87 Difference]: Start difference. First operand 9576 states and 13921 transitions. Second operand has 32 states, 32 states have (on average 17.21875) internal successors, (551), 31 states have internal predecessors, (551), 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)