./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:40:28,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:40:28,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:40:28,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:40:28,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:40:28,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:40:28,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:40:28,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:40:28,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:40:28,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:40:28,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:40:28,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:40:28,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:40:28,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:40:28,883 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:40:28,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:40:28,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:40:28,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:28,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:28,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:28,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:40:28,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:40:28,887 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc [2025-01-08 23:40:29,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:40:29,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:40:29,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:40:29,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:40:29,065 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:40:29,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2025-01-08 23:40:30,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5771b32/95742b618e974e88bea73ae0ef41f8ab/FLAG804cf6dcd [2025-01-08 23:40:30,538 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:40:30,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2025-01-08 23:40:30,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5771b32/95742b618e974e88bea73ae0ef41f8ab/FLAG804cf6dcd [2025-01-08 23:40:30,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a5771b32/95742b618e974e88bea73ae0ef41f8ab [2025-01-08 23:40:30,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:40:30,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:40:30,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:30,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:40:30,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:40:30,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:30" (1/1) ... [2025-01-08 23:40:30,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d36a473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:30, skipping insertion in model container [2025-01-08 23:40:30,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:30" (1/1) ... [2025-01-08 23:40:30,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:40:30,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2025-01-08 23:40:30,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:30,956 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:40:30,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c[7865,7878] [2025-01-08 23:40:31,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:31,110 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:40:31,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31 WrapperNode [2025-01-08 23:40:31,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:31,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:31,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:40:31,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:40:31,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,242 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:40:31,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:31,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:40:31,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:40:31,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:40:31,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,349 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:40:31,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:40:31,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:40:31,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:40:31,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:40:31,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (1/1) ... [2025-01-08 23:40:31,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:31,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:40:31,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:40:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:40:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:40:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:40:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:40:31,551 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:40:31,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:40:32,800 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:40:32,801 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:40:32,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:40:32,820 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:40:32,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:32 BoogieIcfgContainer [2025-01-08 23:40:32,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:40:32,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:40:32,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:40:32,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:40:32,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:40:30" (1/3) ... [2025-01-08 23:40:32,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfab6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:32, skipping insertion in model container [2025-01-08 23:40:32,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:31" (2/3) ... [2025-01-08 23:40:32,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfab6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:32, skipping insertion in model container [2025-01-08 23:40:32,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:32" (3/3) ... [2025-01-08 23:40:32,836 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2025-01-08 23:40:32,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:40:32,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label02.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:40:32,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:40:32,922 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;@77682831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:40:32,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:40:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 23:40:32,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:32,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:32,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:32,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1116694966, now seen corresponding path program 1 times [2025-01-08 23:40:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:32,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725809809] [2025-01-08 23:40:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:33,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-08 23:40:33,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-08 23:40:33,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:33,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:33,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725809809] [2025-01-08 23:40:33,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725809809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:33,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771309374] [2025-01-08 23:40:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:33,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:33,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:33,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:33,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:33,319 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:34,474 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-01-08 23:40:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-08 23:40:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:34,487 INFO L225 Difference]: With dead ends: 761 [2025-01-08 23:40:34,487 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:40:34,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:34,500 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 174 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:34,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:40:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:40:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-08 23:40:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-01-08 23:40:34,580 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 54 [2025-01-08 23:40:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-01-08 23:40:34,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-01-08 23:40:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-08 23:40:34,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:34,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:34,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:40:34,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash 666279650, now seen corresponding path program 1 times [2025-01-08 23:40:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353219171] [2025-01-08 23:40:34,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:34,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-08 23:40:34,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-08 23:40:34,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:34,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353219171] [2025-01-08 23:40:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353219171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:34,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887511798] [2025-01-08 23:40:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:34,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:34,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:34,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:34,856 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:35,506 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-01-08 23:40:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-08 23:40:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:35,511 INFO L225 Difference]: With dead ends: 1211 [2025-01-08 23:40:35,511 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:40:35,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:35,515 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:35,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:40:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-01-08 23:40:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:40:35,555 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 122 [2025-01-08 23:40:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:35,556 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:40:35,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:40:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-08 23:40:35,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:35,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:35,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:40:35,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:35,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1044901789, now seen corresponding path program 1 times [2025-01-08 23:40:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394903535] [2025-01-08 23:40:35,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:35,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-08 23:40:35,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-08 23:40:35,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:35,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:35,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394903535] [2025-01-08 23:40:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394903535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922769366] [2025-01-08 23:40:35,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:35,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:35,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:35,859 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:36,522 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-01-08 23:40:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-08 23:40:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:36,527 INFO L225 Difference]: With dead ends: 2316 [2025-01-08 23:40:36,527 INFO L226 Difference]: Without dead ends: 1529 [2025-01-08 23:40:36,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:36,529 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:36,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-01-08 23:40:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-01-08 23:40:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:40:36,551 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 124 [2025-01-08 23:40:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:36,551 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:40:36,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:40:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-08 23:40:36,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:36,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:36,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:40:36,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:36,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -768123494, now seen corresponding path program 1 times [2025-01-08 23:40:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823229194] [2025-01-08 23:40:36,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-08 23:40:36,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-08 23:40:36,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:36,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823229194] [2025-01-08 23:40:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823229194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942650368] [2025-01-08 23:40:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:36,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:36,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:36,758 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:37,376 INFO L93 Difference]: Finished difference Result 3257 states and 4125 transitions. [2025-01-08 23:40:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-01-08 23:40:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:37,382 INFO L225 Difference]: With dead ends: 3257 [2025-01-08 23:40:37,382 INFO L226 Difference]: Without dead ends: 1917 [2025-01-08 23:40:37,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:37,384 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:37,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-08 23:40:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-01-08 23:40:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-01-08 23:40:37,413 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 181 [2025-01-08 23:40:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-01-08 23:40:37,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-01-08 23:40:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 23:40:37,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:37,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:40:37,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:40:37,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:37,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1395433785, now seen corresponding path program 1 times [2025-01-08 23:40:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:37,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389252084] [2025-01-08 23:40:37,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:37,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 23:40:37,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 23:40:37,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:40:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389252084] [2025-01-08 23:40:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389252084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546760899] [2025-01-08 23:40:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:37,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:37,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:37,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:37,690 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:38,451 INFO L93 Difference]: Finished difference Result 4389 states and 5592 transitions. [2025-01-08 23:40:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 236 [2025-01-08 23:40:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:38,458 INFO L225 Difference]: With dead ends: 4389 [2025-01-08 23:40:38,458 INFO L226 Difference]: Without dead ends: 2661 [2025-01-08 23:40:38,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:38,460 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:38,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 391 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:40:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-01-08 23:40:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-01-08 23:40:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.235198702351987) internal successors, (3046), 2466 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3046 transitions. [2025-01-08 23:40:38,487 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3046 transitions. Word has length 236 [2025-01-08 23:40:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:38,487 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3046 transitions. [2025-01-08 23:40:38,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3046 transitions. [2025-01-08 23:40:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-08 23:40:38,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:38,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-08 23:40:38,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:40:38,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:38,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -428997014, now seen corresponding path program 1 times [2025-01-08 23:40:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771464932] [2025-01-08 23:40:38,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:38,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-08 23:40:38,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-08 23:40:38,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:38,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 25 proven. 78 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:40:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771464932] [2025-01-08 23:40:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771464932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531977725] [2025-01-08 23:40:38,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:38,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:38,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:38,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:38,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:40:38,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-08 23:40:38,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-08 23:40:38,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:38,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:38,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:40:38,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:40:39,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531977725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:39,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:40:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240297077] [2025-01-08 23:40:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:39,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:39,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:39,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:39,055 INFO L87 Difference]: Start difference. First operand 2467 states and 3046 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:39,720 INFO L93 Difference]: Finished difference Result 6409 states and 8063 transitions. [2025-01-08 23:40:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:39,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 242 [2025-01-08 23:40:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:39,729 INFO L225 Difference]: With dead ends: 6409 [2025-01-08 23:40:39,729 INFO L226 Difference]: Without dead ends: 3944 [2025-01-08 23:40:39,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:39,733 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 176 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:39,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 270 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-01-08 23:40:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3941. [2025-01-08 23:40:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 1.232233502538071) internal successors, (4855), 3940 states have internal predecessors, (4855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 4855 transitions. [2025-01-08 23:40:39,781 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 4855 transitions. Word has length 242 [2025-01-08 23:40:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:39,781 INFO L471 AbstractCegarLoop]: Abstraction has 3941 states and 4855 transitions. [2025-01-08 23:40:39,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 4855 transitions. [2025-01-08 23:40:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-08 23:40:39,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:39,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:40:39,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:40:39,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:39,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:39,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1606900219, now seen corresponding path program 1 times [2025-01-08 23:40:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146521873] [2025-01-08 23:40:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:40,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 23:40:40,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 23:40:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146521873] [2025-01-08 23:40:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146521873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:40,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807232671] [2025-01-08 23:40:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:40,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:40,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:40,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:40,362 INFO L87 Difference]: Start difference. First operand 3941 states and 4855 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:41,489 INFO L93 Difference]: Finished difference Result 12154 states and 15362 transitions. [2025-01-08 23:40:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:41,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2025-01-08 23:40:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:41,509 INFO L225 Difference]: With dead ends: 12154 [2025-01-08 23:40:41,510 INFO L226 Difference]: Without dead ends: 8399 [2025-01-08 23:40:41,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:41,516 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 291 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:41,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 87 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:40:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8399 states. [2025-01-08 23:40:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8399 to 8395. [2025-01-08 23:40:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8395 states, 8394 states have (on average 1.2446985942339766) internal successors, (10448), 8394 states have internal predecessors, (10448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 10448 transitions. [2025-01-08 23:40:41,618 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 10448 transitions. Word has length 281 [2025-01-08 23:40:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:41,619 INFO L471 AbstractCegarLoop]: Abstraction has 8395 states and 10448 transitions. [2025-01-08 23:40:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 10448 transitions. [2025-01-08 23:40:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-01-08 23:40:41,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:41,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:41,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:40:41,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:41,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 226265902, now seen corresponding path program 1 times [2025-01-08 23:40:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908597571] [2025-01-08 23:40:41,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:41,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-08 23:40:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-08 23:40:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-08 23:40:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908597571] [2025-01-08 23:40:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908597571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486330367] [2025-01-08 23:40:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:41,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:41,841 INFO L87 Difference]: Start difference. First operand 8395 states and 10448 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:42,525 INFO L93 Difference]: Finished difference Result 19009 states and 23857 transitions. [2025-01-08 23:40:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 290 [2025-01-08 23:40:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:42,559 INFO L225 Difference]: With dead ends: 19009 [2025-01-08 23:40:42,559 INFO L226 Difference]: Without dead ends: 10800 [2025-01-08 23:40:42,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:42,570 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:42,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 384 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10800 states. [2025-01-08 23:40:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10800 to 10786. [2025-01-08 23:40:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10786 states, 10785 states have (on average 1.2124246638850256) internal successors, (13076), 10785 states have internal predecessors, (13076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10786 states to 10786 states and 13076 transitions. [2025-01-08 23:40:42,782 INFO L78 Accepts]: Start accepts. Automaton has 10786 states and 13076 transitions. Word has length 290 [2025-01-08 23:40:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:42,783 INFO L471 AbstractCegarLoop]: Abstraction has 10786 states and 13076 transitions. [2025-01-08 23:40:42,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 10786 states and 13076 transitions. [2025-01-08 23:40:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-08 23:40:42,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:42,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:42,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:40:42,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:42,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 731321047, now seen corresponding path program 1 times [2025-01-08 23:40:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:42,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459721757] [2025-01-08 23:40:42,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:42,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-08 23:40:42,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-08 23:40:42,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:42,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459721757] [2025-01-08 23:40:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459721757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131323975] [2025-01-08 23:40:43,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:43,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:43,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:40:43,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-08 23:40:43,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-08 23:40:43,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:43,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:43,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 23:40:43,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:44,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:40:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:45,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131323975] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:40:45,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:40:45,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 23:40:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538168964] [2025-01-08 23:40:45,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:40:45,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 23:40:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:45,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 23:40:45,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:40:45,929 INFO L87 Difference]: Start difference. First operand 10786 states and 13076 transitions. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:48,049 INFO L93 Difference]: Finished difference Result 24936 states and 30415 transitions. [2025-01-08 23:40:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-08 23:40:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 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 328 [2025-01-08 23:40:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:48,079 INFO L225 Difference]: With dead ends: 24936 [2025-01-08 23:40:48,082 INFO L226 Difference]: Without dead ends: 14889 [2025-01-08 23:40:48,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-01-08 23:40:48,099 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1023 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:48,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 180 Invalid, 2744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:40:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14889 states. [2025-01-08 23:40:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14889 to 11495. [2025-01-08 23:40:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11495 states, 11494 states have (on average 1.1814859926918393) internal successors, (13580), 11494 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11495 states to 11495 states and 13580 transitions. [2025-01-08 23:40:48,385 INFO L78 Accepts]: Start accepts. Automaton has 11495 states and 13580 transitions. Word has length 328 [2025-01-08 23:40:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:48,385 INFO L471 AbstractCegarLoop]: Abstraction has 11495 states and 13580 transitions. [2025-01-08 23:40:48,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11495 states and 13580 transitions. [2025-01-08 23:40:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-08 23:40:48,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:48,400 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:48,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:40:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:48,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:48,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1111255172, now seen corresponding path program 1 times [2025-01-08 23:40:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862728675] [2025-01-08 23:40:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:48,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-08 23:40:48,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-08 23:40:48,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:48,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 188 proven. 148 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:40:49,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862728675] [2025-01-08 23:40:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862728675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273625283] [2025-01-08 23:40:49,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:49,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:49,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:49,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:40:49,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-08 23:40:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-08 23:40:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:49,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:40:49,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:40:49,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273625283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:40:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206623595] [2025-01-08 23:40:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:49,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:40:49,505 INFO L87 Difference]: Start difference. First operand 11495 states and 13580 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:50,122 INFO L93 Difference]: Finished difference Result 21529 states and 25565 transitions. [2025-01-08 23:40:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:50,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 348 [2025-01-08 23:40:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:50,141 INFO L225 Difference]: With dead ends: 21529 [2025-01-08 23:40:50,141 INFO L226 Difference]: Without dead ends: 11510 [2025-01-08 23:40:50,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:40:50,150 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 105 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:50,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 327 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2025-01-08 23:40:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 11495. [2025-01-08 23:40:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11495 states, 11494 states have (on average 1.151731338089438) internal successors, (13238), 11494 states have internal predecessors, (13238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11495 states to 11495 states and 13238 transitions. [2025-01-08 23:40:50,270 INFO L78 Accepts]: Start accepts. Automaton has 11495 states and 13238 transitions. Word has length 348 [2025-01-08 23:40:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:50,270 INFO L471 AbstractCegarLoop]: Abstraction has 11495 states and 13238 transitions. [2025-01-08 23:40:50,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11495 states and 13238 transitions. [2025-01-08 23:40:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-08 23:40:50,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:50,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:50,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:40:50,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:50,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:50,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1208107914, now seen corresponding path program 1 times [2025-01-08 23:40:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380038317] [2025-01-08 23:40:50,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:50,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-08 23:40:50,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-08 23:40:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380038317] [2025-01-08 23:40:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380038317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:50,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:50,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:50,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454275659] [2025-01-08 23:40:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:50,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:50,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:50,730 INFO L87 Difference]: Start difference. First operand 11495 states and 13238 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:51,414 INFO L93 Difference]: Finished difference Result 27776 states and 32085 transitions. [2025-01-08 23:40:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-01-08 23:40:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:51,438 INFO L225 Difference]: With dead ends: 27776 [2025-01-08 23:40:51,439 INFO L226 Difference]: Without dead ends: 17019 [2025-01-08 23:40:51,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:51,451 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:51,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 71 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2025-01-08 23:40:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 17011. [2025-01-08 23:40:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17011 states, 17010 states have (on average 1.1413286302175192) internal successors, (19414), 17010 states have internal predecessors, (19414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 19414 transitions. [2025-01-08 23:40:51,606 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 19414 transitions. Word has length 356 [2025-01-08 23:40:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:51,606 INFO L471 AbstractCegarLoop]: Abstraction has 17011 states and 19414 transitions. [2025-01-08 23:40:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 19414 transitions. [2025-01-08 23:40:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-08 23:40:51,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:51,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:40:51,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:40:51,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:51,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1483113709, now seen corresponding path program 1 times [2025-01-08 23:40:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446358914] [2025-01-08 23:40:51,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:51,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:40:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:40:51,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:40:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446358914] [2025-01-08 23:40:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446358914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932393635] [2025-01-08 23:40:52,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:52,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:52,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:52,116 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-01-08 23:40:52,118 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-01-08 23:40:52,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:40:52,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:40:52,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:52,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:52,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:40:52,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:40:52,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:40:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:40:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932393635] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:40:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-08 23:40:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129131342] [2025-01-08 23:40:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:53,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:53,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:53,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:40:53,786 INFO L87 Difference]: Start difference. First operand 17011 states and 19414 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:54,411 INFO L93 Difference]: Finished difference Result 34196 states and 39044 transitions. [2025-01-08 23:40:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 359 [2025-01-08 23:40:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:54,430 INFO L225 Difference]: With dead ends: 34196 [2025-01-08 23:40:54,431 INFO L226 Difference]: Without dead ends: 19397 [2025-01-08 23:40:54,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:40:54,442 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 176 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:54,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 118 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19397 states. [2025-01-08 23:40:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19397 to 17189. [2025-01-08 23:40:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17189 states, 17188 states have (on average 1.1267163137072376) internal successors, (19366), 17188 states have internal predecessors, (19366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17189 states to 17189 states and 19366 transitions. [2025-01-08 23:40:54,611 INFO L78 Accepts]: Start accepts. Automaton has 17189 states and 19366 transitions. Word has length 359 [2025-01-08 23:40:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:54,612 INFO L471 AbstractCegarLoop]: Abstraction has 17189 states and 19366 transitions. [2025-01-08 23:40:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 17189 states and 19366 transitions. [2025-01-08 23:40:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-08 23:40:54,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:54,621 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:54,627 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-01-08 23:40:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:40:54,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -346444401, now seen corresponding path program 1 times [2025-01-08 23:40:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624680107] [2025-01-08 23:40:54,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:54,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-08 23:40:54,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-08 23:40:54,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:54,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-08 23:40:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624680107] [2025-01-08 23:40:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624680107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085783550] [2025-01-08 23:40:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:54,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:54,929 INFO L87 Difference]: Start difference. First operand 17189 states and 19366 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 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-01-08 23:40:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:55,412 INFO L93 Difference]: Finished difference Result 30122 states and 33800 transitions. [2025-01-08 23:40:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 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) Word has length 390 [2025-01-08 23:40:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:55,429 INFO L225 Difference]: With dead ends: 30122 [2025-01-08 23:40:55,430 INFO L226 Difference]: Without dead ends: 15145 [2025-01-08 23:40:55,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:55,438 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 135 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:55,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 134 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15145 states. [2025-01-08 23:40:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15145 to 14960. [2025-01-08 23:40:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14960 states, 14959 states have (on average 1.110435189518016) internal successors, (16611), 14959 states have internal predecessors, (16611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14960 states to 14960 states and 16611 transitions. [2025-01-08 23:40:55,542 INFO L78 Accepts]: Start accepts. Automaton has 14960 states and 16611 transitions. Word has length 390 [2025-01-08 23:40:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:55,543 INFO L471 AbstractCegarLoop]: Abstraction has 14960 states and 16611 transitions. [2025-01-08 23:40:55,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 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-01-08 23:40:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 14960 states and 16611 transitions. [2025-01-08 23:40:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-08 23:40:55,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:55,599 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:55,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:40:55,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:55,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1774319362, now seen corresponding path program 1 times [2025-01-08 23:40:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:55,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316993655] [2025-01-08 23:40:55,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:55,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:55,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-08 23:40:55,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-08 23:40:55,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:55,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-01-08 23:40:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316993655] [2025-01-08 23:40:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316993655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147834511] [2025-01-08 23:40:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:55,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:55,789 INFO L87 Difference]: Start difference. First operand 14960 states and 16611 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:56,367 INFO L93 Difference]: Finished difference Result 29363 states and 32641 transitions. [2025-01-08 23:40:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 446 [2025-01-08 23:40:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:56,384 INFO L225 Difference]: With dead ends: 29363 [2025-01-08 23:40:56,385 INFO L226 Difference]: Without dead ends: 16615 [2025-01-08 23:40:56,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:56,393 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 102 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:56,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 324 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16615 states. [2025-01-08 23:40:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16615 to 14583. [2025-01-08 23:40:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14583 states, 14582 states have (on average 1.1051981895487588) internal successors, (16116), 14582 states have internal predecessors, (16116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14583 states to 14583 states and 16116 transitions. [2025-01-08 23:40:56,501 INFO L78 Accepts]: Start accepts. Automaton has 14583 states and 16116 transitions. Word has length 446 [2025-01-08 23:40:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:56,502 INFO L471 AbstractCegarLoop]: Abstraction has 14583 states and 16116 transitions. [2025-01-08 23:40:56,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14583 states and 16116 transitions. [2025-01-08 23:40:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-08 23:40:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:56,512 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:56,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:40:56,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:56,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2089616602, now seen corresponding path program 1 times [2025-01-08 23:40:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924484056] [2025-01-08 23:40:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:56,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:40:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:40:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:40:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924484056] [2025-01-08 23:40:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924484056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:56,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403560771] [2025-01-08 23:40:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:56,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:56,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:56,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:56,818 INFO L87 Difference]: Start difference. First operand 14583 states and 16116 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:57,368 INFO L93 Difference]: Finished difference Result 27509 states and 30414 transitions. [2025-01-08 23:40:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 480 [2025-01-08 23:40:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:57,380 INFO L225 Difference]: With dead ends: 27509 [2025-01-08 23:40:57,381 INFO L226 Difference]: Without dead ends: 14954 [2025-01-08 23:40:57,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:57,388 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 89 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:57,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 172 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14954 states. [2025-01-08 23:40:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14954 to 14951. [2025-01-08 23:40:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14951 states, 14950 states have (on average 1.0992642140468227) internal successors, (16434), 14950 states have internal predecessors, (16434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14951 states to 14951 states and 16434 transitions. [2025-01-08 23:40:57,490 INFO L78 Accepts]: Start accepts. Automaton has 14951 states and 16434 transitions. Word has length 480 [2025-01-08 23:40:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:57,491 INFO L471 AbstractCegarLoop]: Abstraction has 14951 states and 16434 transitions. [2025-01-08 23:40:57,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14951 states and 16434 transitions. [2025-01-08 23:40:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-08 23:40:57,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:57,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:40:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:40:57,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2072358444, now seen corresponding path program 1 times [2025-01-08 23:40:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131732545] [2025-01-08 23:40:57,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-08 23:40:57,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-08 23:40:57,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:57,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:40:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131732545] [2025-01-08 23:40:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131732545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:57,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:40:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508184998] [2025-01-08 23:40:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:57,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:57,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:57,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:57,837 INFO L87 Difference]: Start difference. First operand 14951 states and 16434 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:58,607 INFO L93 Difference]: Finished difference Result 29715 states and 32651 transitions. [2025-01-08 23:40:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 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 481 [2025-01-08 23:40:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:58,619 INFO L225 Difference]: With dead ends: 29715 [2025-01-08 23:40:58,619 INFO L226 Difference]: Without dead ends: 15502 [2025-01-08 23:40:58,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:58,627 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:58,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 148 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:40:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15502 states. [2025-01-08 23:40:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15502 to 14950. [2025-01-08 23:40:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14950 states, 14949 states have (on average 1.08930363234999) internal successors, (16284), 14949 states have internal predecessors, (16284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 16284 transitions. [2025-01-08 23:40:58,733 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 16284 transitions. Word has length 481 [2025-01-08 23:40:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 14950 states and 16284 transitions. [2025-01-08 23:40:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 16284 transitions. [2025-01-08 23:40:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-08 23:40:58,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:58,743 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-08 23:40:58,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:40:58,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash -872585386, now seen corresponding path program 1 times [2025-01-08 23:40:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868455621] [2025-01-08 23:40:58,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:58,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-08 23:40:58,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-08 23:40:58,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:58,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 578 proven. 133 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:40:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868455621] [2025-01-08 23:40:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868455621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125654949] [2025-01-08 23:40:59,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:59,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:59,314 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-01-08 23:40:59,317 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-01-08 23:40:59,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-08 23:40:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-08 23:40:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:59,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:40:59,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-08 23:40:59,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125654949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:40:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891937819] [2025-01-08 23:40:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:59,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:40:59,590 INFO L87 Difference]: Start difference. First operand 14950 states and 16284 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:00,184 INFO L93 Difference]: Finished difference Result 29537 states and 32221 transitions. [2025-01-08 23:41:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:00,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 518 [2025-01-08 23:41:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:00,199 INFO L225 Difference]: With dead ends: 29537 [2025-01-08 23:41:00,200 INFO L226 Difference]: Without dead ends: 16799 [2025-01-08 23:41:00,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:00,209 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:00,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 329 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2025-01-08 23:41:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 14766. [2025-01-08 23:41:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14766 states, 14765 states have (on average 1.0896037927531323) internal successors, (16088), 14765 states have internal predecessors, (16088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14766 states to 14766 states and 16088 transitions. [2025-01-08 23:41:00,372 INFO L78 Accepts]: Start accepts. Automaton has 14766 states and 16088 transitions. Word has length 518 [2025-01-08 23:41:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:00,372 INFO L471 AbstractCegarLoop]: Abstraction has 14766 states and 16088 transitions. [2025-01-08 23:41:00,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14766 states and 16088 transitions. [2025-01-08 23:41:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-08 23:41:00,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:00,388 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:41:00,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 23:41:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 23:41:00,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 622169664, now seen corresponding path program 1 times [2025-01-08 23:41:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400311040] [2025-01-08 23:41:00,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-08 23:41:00,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-08 23:41:00,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:00,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-01-08 23:41:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400311040] [2025-01-08 23:41:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400311040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933952777] [2025-01-08 23:41:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:00,915 INFO L87 Difference]: Start difference. First operand 14766 states and 16088 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:01,605 INFO L93 Difference]: Finished difference Result 31373 states and 34247 transitions. [2025-01-08 23:41:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:01,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 572 [2025-01-08 23:41:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:01,620 INFO L225 Difference]: With dead ends: 31373 [2025-01-08 23:41:01,621 INFO L226 Difference]: Without dead ends: 17529 [2025-01-08 23:41:01,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:01,629 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:01,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 71 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2025-01-08 23:41:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 14582. [2025-01-08 23:41:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14582 states, 14581 states have (on average 1.0890885398806667) internal successors, (15880), 14581 states have internal predecessors, (15880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14582 states to 14582 states and 15880 transitions. [2025-01-08 23:41:01,742 INFO L78 Accepts]: Start accepts. Automaton has 14582 states and 15880 transitions. Word has length 572 [2025-01-08 23:41:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:01,742 INFO L471 AbstractCegarLoop]: Abstraction has 14582 states and 15880 transitions. [2025-01-08 23:41:01,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14582 states and 15880 transitions. [2025-01-08 23:41:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-01-08 23:41:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:01,754 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-08 23:41:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:41:01,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1129278830, now seen corresponding path program 1 times [2025-01-08 23:41:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671976172] [2025-01-08 23:41:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:01,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-01-08 23:41:01,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-08 23:41:01,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-01-08 23:41:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671976172] [2025-01-08 23:41:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671976172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890590754] [2025-01-08 23:41:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:02,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:02,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:02,156 INFO L87 Difference]: Start difference. First operand 14582 states and 15880 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:03,029 INFO L93 Difference]: Finished difference Result 28619 states and 31144 transitions. [2025-01-08 23:41:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 682 [2025-01-08 23:41:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:03,053 INFO L225 Difference]: With dead ends: 28619 [2025-01-08 23:41:03,053 INFO L226 Difference]: Without dead ends: 16064 [2025-01-08 23:41:03,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:03,061 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 206 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:03,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 70 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2025-01-08 23:41:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 13478. [2025-01-08 23:41:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13478 states, 13477 states have (on average 1.090079394524004) internal successors, (14691), 13477 states have internal predecessors, (14691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13478 states to 13478 states and 14691 transitions. [2025-01-08 23:41:03,159 INFO L78 Accepts]: Start accepts. Automaton has 13478 states and 14691 transitions. Word has length 682 [2025-01-08 23:41:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:03,159 INFO L471 AbstractCegarLoop]: Abstraction has 13478 states and 14691 transitions. [2025-01-08 23:41:03,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13478 states and 14691 transitions. [2025-01-08 23:41:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-01-08 23:41:03,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:03,170 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2025-01-08 23:41:03,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:41:03,170 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash 173194180, now seen corresponding path program 1 times [2025-01-08 23:41:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:03,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727132457] [2025-01-08 23:41:03,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:03,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-01-08 23:41:03,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-01-08 23:41:03,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:03,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1080 proven. 363 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2025-01-08 23:41:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727132457] [2025-01-08 23:41:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727132457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927162403] [2025-01-08 23:41:04,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:04,328 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-01-08 23:41:04,329 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-01-08 23:41:04,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-01-08 23:41:04,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-01-08 23:41:04,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:04,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:04,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:41:04,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1429 proven. 380 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 23:41:05,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:41:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1809 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-08 23:41:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927162403] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:05,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:41:05,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2025-01-08 23:41:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728672109] [2025-01-08 23:41:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:05,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:41:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:05,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:41:05,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:41:05,995 INFO L87 Difference]: Start difference. First operand 13478 states and 14691 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:07,161 INFO L93 Difference]: Finished difference Result 29903 states and 32630 transitions. [2025-01-08 23:41:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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 788 [2025-01-08 23:41:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:07,177 INFO L225 Difference]: With dead ends: 29903 [2025-01-08 23:41:07,177 INFO L226 Difference]: Without dead ends: 18637 [2025-01-08 23:41:07,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1580 GetRequests, 1570 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:41:07,185 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 382 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:07,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 65 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:41:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18637 states. [2025-01-08 23:41:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18637 to 12558. [2025-01-08 23:41:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12558 states, 12557 states have (on average 1.0904674683443498) internal successors, (13693), 12557 states have internal predecessors, (13693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12558 states to 12558 states and 13693 transitions. [2025-01-08 23:41:07,353 INFO L78 Accepts]: Start accepts. Automaton has 12558 states and 13693 transitions. Word has length 788 [2025-01-08 23:41:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:07,354 INFO L471 AbstractCegarLoop]: Abstraction has 12558 states and 13693 transitions. [2025-01-08 23:41:07,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 12558 states and 13693 transitions. [2025-01-08 23:41:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-01-08 23:41:07,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:07,373 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:41:07,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 23:41:07,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:07,574 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:07,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1056622749, now seen corresponding path program 1 times [2025-01-08 23:41:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27695468] [2025-01-08 23:41:07,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:07,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-01-08 23:41:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-01-08 23:41:07,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:07,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3199 backedges. 2045 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2025-01-08 23:41:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27695468] [2025-01-08 23:41:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27695468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094604674] [2025-01-08 23:41:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:07,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:07,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:07,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:07,900 INFO L87 Difference]: Start difference. First operand 12558 states and 13693 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:08,423 INFO L93 Difference]: Finished difference Result 26770 states and 29178 transitions. [2025-01-08 23:41:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 947 [2025-01-08 23:41:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:08,437 INFO L225 Difference]: With dead ends: 26770 [2025-01-08 23:41:08,437 INFO L226 Difference]: Without dead ends: 14214 [2025-01-08 23:41:08,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:08,445 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 132 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:08,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 108 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2025-01-08 23:41:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 12926. [2025-01-08 23:41:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12926 states, 12925 states have (on average 1.0837137330754352) internal successors, (14007), 12925 states have internal predecessors, (14007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12926 states to 12926 states and 14007 transitions. [2025-01-08 23:41:08,553 INFO L78 Accepts]: Start accepts. Automaton has 12926 states and 14007 transitions. Word has length 947 [2025-01-08 23:41:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 12926 states and 14007 transitions. [2025-01-08 23:41:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12926 states and 14007 transitions. [2025-01-08 23:41:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2025-01-08 23:41:08,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:08,566 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-08 23:41:08,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:41:08,566 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1648031877, now seen corresponding path program 1 times [2025-01-08 23:41:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:08,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942636842] [2025-01-08 23:41:08,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:08,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1097 statements into 1 equivalence classes. [2025-01-08 23:41:08,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1097 of 1097 statements. [2025-01-08 23:41:08,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:08,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 2136 proven. 969 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-01-08 23:41:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942636842] [2025-01-08 23:41:10,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942636842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682421001] [2025-01-08 23:41:10,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:10,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:10,033 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-01-08 23:41:10,034 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-01-08 23:41:10,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1097 statements into 1 equivalence classes. [2025-01-08 23:41:10,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1097 of 1097 statements. [2025-01-08 23:41:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:10,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:41:10,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 2128 proven. 0 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2025-01-08 23:41:10,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682421001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:10,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:10,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-01-08 23:41:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410492571] [2025-01-08 23:41:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:10,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:10,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:10,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:41:10,570 INFO L87 Difference]: Start difference. First operand 12926 states and 14007 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:11,121 INFO L93 Difference]: Finished difference Result 26411 states and 28624 transitions. [2025-01-08 23:41:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 1097 [2025-01-08 23:41:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:11,133 INFO L225 Difference]: With dead ends: 26411 [2025-01-08 23:41:11,133 INFO L226 Difference]: Without dead ends: 13487 [2025-01-08 23:41:11,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1098 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:41:11,143 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:11,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 328 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13487 states. [2025-01-08 23:41:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13487 to 13114. [2025-01-08 23:41:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.0817509341874476) internal successors, (14185), 13113 states have internal predecessors, (14185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 14185 transitions. [2025-01-08 23:41:11,248 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 14185 transitions. Word has length 1097 [2025-01-08 23:41:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:11,248 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 14185 transitions. [2025-01-08 23:41:11,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 14185 transitions. [2025-01-08 23:41:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2025-01-08 23:41:11,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:11,261 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-08 23:41:11,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 23:41:11,461 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-01-08 23:41:11,462 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 725135553, now seen corresponding path program 1 times [2025-01-08 23:41:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020145691] [2025-01-08 23:41:11,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:11,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1159 statements into 1 equivalence classes. [2025-01-08 23:41:11,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1159 of 1159 statements. [2025-01-08 23:41:11,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:11,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4966 backedges. 2877 proven. 0 refuted. 0 times theorem prover too weak. 2089 trivial. 0 not checked. [2025-01-08 23:41:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:12,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020145691] [2025-01-08 23:41:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020145691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:12,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:12,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:12,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930147546] [2025-01-08 23:41:12,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:12,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:12,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:12,104 INFO L87 Difference]: Start difference. First operand 13114 states and 14185 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:12,597 INFO L93 Difference]: Finished difference Result 26962 states and 29170 transitions. [2025-01-08 23:41:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 1159 [2025-01-08 23:41:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:12,609 INFO L225 Difference]: With dead ends: 26962 [2025-01-08 23:41:12,609 INFO L226 Difference]: Without dead ends: 13666 [2025-01-08 23:41:12,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:12,617 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 108 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:12,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 148 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:41:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2025-01-08 23:41:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 12378. [2025-01-08 23:41:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12378 states, 12377 states have (on average 1.077805607174598) internal successors, (13340), 12377 states have internal predecessors, (13340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12378 states to 12378 states and 13340 transitions. [2025-01-08 23:41:12,716 INFO L78 Accepts]: Start accepts. Automaton has 12378 states and 13340 transitions. Word has length 1159 [2025-01-08 23:41:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 12378 states and 13340 transitions. [2025-01-08 23:41:12,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12378 states and 13340 transitions. [2025-01-08 23:41:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1233 [2025-01-08 23:41:12,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:12,755 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-08 23:41:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:41:12,756 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 588613214, now seen corresponding path program 1 times [2025-01-08 23:41:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984701] [2025-01-08 23:41:12,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1232 statements into 1 equivalence classes. [2025-01-08 23:41:12,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1232 of 1232 statements. [2025-01-08 23:41:12,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:12,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5747 backedges. 3337 proven. 552 refuted. 0 times theorem prover too weak. 1858 trivial. 0 not checked. [2025-01-08 23:41:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984701] [2025-01-08 23:41:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868092054] [2025-01-08 23:41:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:14,454 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-01-08 23:41:14,455 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-01-08 23:41:14,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1232 statements into 1 equivalence classes. [2025-01-08 23:41:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1232 of 1232 statements. [2025-01-08 23:41:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:14,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:41:14,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5747 backedges. 3440 proven. 0 refuted. 0 times theorem prover too weak. 2307 trivial. 0 not checked. [2025-01-08 23:41:14,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868092054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-08 23:41:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017918593] [2025-01-08 23:41:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:14,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:14,898 INFO L87 Difference]: Start difference. First operand 12378 states and 13340 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:15,346 INFO L93 Difference]: Finished difference Result 21244 states and 22904 transitions. [2025-01-08 23:41:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:15,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 1232 [2025-01-08 23:41:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:15,347 INFO L225 Difference]: With dead ends: 21244 [2025-01-08 23:41:15,348 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:41:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:15,354 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 98 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 282 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:41:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:41:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:41:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:41:15,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1232 [2025-01-08 23:41:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:15,355 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:41:15,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:41:15,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:41:15,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:41:15,365 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-01-08 23:41:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:15,561 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-08 23:41:15,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:41:19,678 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:41:19,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:41:19 BoogieIcfgContainer [2025-01-08 23:41:19,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:41:19,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:41:19,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:41:19,706 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:41:19,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:32" (3/4) ... [2025-01-08 23:41:19,708 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:41:19,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:41:19,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:41:19,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:41:19,729 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:41:19,847 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:41:19,847 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:41:19,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:41:19,848 INFO L158 Benchmark]: Toolchain (without parser) took 49281.22ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 103.2MB in the beginning and 883.0MB in the end (delta: -779.7MB). Peak memory consumption was 421.7MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,848 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:41:19,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.63ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 60.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.30ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 42.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,849 INFO L158 Benchmark]: Boogie Preprocessor took 195.24ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 80.5MB in the end (delta: -38.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,850 INFO L158 Benchmark]: RCFGBuilder took 1380.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.8MB in the beginning and 231.7MB in the end (delta: -151.9MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,850 INFO L158 Benchmark]: TraceAbstraction took 46883.27ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 230.7MB in the beginning and 899.7MB in the end (delta: -668.9MB). Peak memory consumption was 880.3MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,850 INFO L158 Benchmark]: Witness Printer took 141.20ms. Allocated memory is still 1.3GB. Free memory was 899.7MB in the beginning and 883.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:19,851 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.63ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 60.0MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.30ms. Allocated memory is still 142.6MB. Free memory was 59.1MB in the beginning and 42.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 195.24ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 80.5MB in the end (delta: -38.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1380.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.8MB in the beginning and 231.7MB in the end (delta: -151.9MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * TraceAbstraction took 46883.27ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 230.7MB in the beginning and 899.7MB in the end (delta: -668.9MB). Peak memory consumption was 880.3MB. Max. memory is 16.1GB. * Witness Printer took 141.20ms. Allocated memory is still 1.3GB. Free memory was 899.7MB in the beginning and 883.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 178]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 24, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4589 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4589 mSDsluCounter, 4865 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 2862 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16460 IncrementalHoareTripleChecker+Invalid, 19322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2862 mSolverCounterUnsat, 4317 mSDtfsCounter, 16460 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6473 GetRequests, 6400 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17189occurred in iteration=12, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 25223 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 16625 NumberOfCodeBlocks, 16625 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 18065 ConstructedInterpolants, 0 QuantifiedInterpolants, 61438 SizeOfPredicates, 8 NumberOfNonLiveVariables, 6398 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 35 InterpolantComputations, 23 PerfectInterpolantSequences, 42296/45254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42))) && (a29 <= 130)) || ((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 140)) && (a4 == 0))) || ((((((a25 == 13) && (a29 <= 245)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((a25 <= 10) && (a29 <= 245)) && (141 <= a29)) && (a4 == 1))) || ((((((a25 == 12) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 <= 10) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (141 <= a29)) && (a4 == 1)) && (312 <= a23)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || (((((((a25 == 11) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (141 <= a29))) || ((((((((a25 == 13) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((((a25 == 13) && (141 <= a29)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) && (a23 <= 312))) || (((((a29 <= 275) && (141 <= a29)) && (a4 == 1)) && (312 <= a23)) && (a25 <= 9))) || ((((((((a25 == 12) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((long long) a23 + 43) <= 0) && ((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) || (((a29 <= 140) && (a4 == 0)) && (a25 == 10))))) || (((((a25 == 13) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (312 <= a23)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (141 <= a29)) && (a25 <= 9))) || (((((a25 == 11) && (a29 <= 274)) && (141 <= a29)) && (a4 == 1)) && (a23 <= 312))) || ((((((((a25 == 11) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (141 <= a29))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 9))) || ((((((a25 == 13) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (a29 <= 245)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((((((a25 == 12) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (a29 <= 130))) || ((((((a25 <= 10) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:41:19,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE