./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label30.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/Problem16_label30.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 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:07:33,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:07:33,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:07:33,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:07:33,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:07:33,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:07:33,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:07:33,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:07:33,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:07:33,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:07:33,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:07:33,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:07:33,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:07:33,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:07:33,990 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:07:33,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:07:33,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:07:33,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:07:33,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:33,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:33,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:33,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:07:33,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:07:33,993 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 -> 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e [2025-01-09 00:07:34,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:07:34,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:07:34,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:07:34,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:07:34,208 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:07:34,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-01-09 00:07:35,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e1361d6f/6198f713caf84152bb37d524fbf85eff/FLAG467260c19 [2025-01-09 00:07:35,953 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:07:35,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-01-09 00:07:35,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e1361d6f/6198f713caf84152bb37d524fbf85eff/FLAG467260c19 [2025-01-09 00:07:36,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e1361d6f/6198f713caf84152bb37d524fbf85eff [2025-01-09 00:07:36,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:07:36,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:07:36,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:36,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:07:36,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:07:36,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:36,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c338145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36, skipping insertion in model container [2025-01-09 00:07:36,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:36,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:07:36,308 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/Problem16_label30.c[1812,1825] [2025-01-09 00:07:36,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:36,779 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:07:36,791 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/Problem16_label30.c[1812,1825] [2025-01-09 00:07:36,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:36,945 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:07:36,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36 WrapperNode [2025-01-09 00:07:36,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:36,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:36,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:07:36,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:07:36,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:36,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,091 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:07:37,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:37,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:07:37,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:07:37,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:07:37,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,216 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-09 00:07:37,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:07:37,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:07:37,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:07:37,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:07:37,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (1/1) ... [2025-01-09 00:07:37,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:37,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:37,348 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-09 00:07:37,354 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-09 00:07:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:07:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:07:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:07:37,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:07:37,426 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:07:37,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:07:38,965 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:07:38,966 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:07:38,986 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:07:38,986 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:07:38,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:38 BoogieIcfgContainer [2025-01-09 00:07:38,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:07:38,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:07:38,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:07:38,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:07:38,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:07:36" (1/3) ... [2025-01-09 00:07:39,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45045f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:39, skipping insertion in model container [2025-01-09 00:07:39,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:36" (2/3) ... [2025-01-09 00:07:39,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45045f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:39, skipping insertion in model container [2025-01-09 00:07:39,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:38" (3/3) ... [2025-01-09 00:07:39,004 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label30.c [2025-01-09 00:07:39,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:07:39,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label30.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:07:39,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:07:39,118 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;@16c0ff44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:07:39,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:07:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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-09 00:07:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 00:07:39,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:39,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:39,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1346991276, now seen corresponding path program 1 times [2025-01-09 00:07:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510605400] [2025-01-09 00:07:39,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:39,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 00:07:39,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 00:07:39,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:39,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:39,402 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-09 00:07:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510605400] [2025-01-09 00:07:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510605400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430301423] [2025-01-09 00:07:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:39,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:39,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:39,439 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-09 00:07:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:41,554 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-01-09 00:07:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:41,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-01-09 00:07:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:41,574 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 00:07:41,574 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:07:41,582 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-09 00:07:41,589 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 369 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:41,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:07:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:07:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:07:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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-09 00:07:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-01-09 00:07:41,666 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 15 [2025-01-09 00:07:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:41,666 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-01-09 00:07:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-09 00:07:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-01-09 00:07:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 00:07:41,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:41,668 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:07:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:07:41,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1576160844, now seen corresponding path program 1 times [2025-01-09 00:07:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397869119] [2025-01-09 00:07:41,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:41,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 00:07:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 00:07:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397869119] [2025-01-09 00:07:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397869119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205237707] [2025-01-09 00:07:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:41,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:41,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:41,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:41,857 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-09 00:07:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:42,879 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-01-09 00:07:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 00:07:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:42,884 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 00:07:42,884 INFO L226 Difference]: Without dead ends: 1320 [2025-01-09 00:07:42,885 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-09 00:07:42,885 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:42,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:07:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-01-09 00:07:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-01-09 00:07:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 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-09 00:07:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2025-01-09 00:07:42,908 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 81 [2025-01-09 00:07:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:42,908 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2025-01-09 00:07:42,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-09 00:07:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2025-01-09 00:07:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 00:07:42,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:42,910 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:07:42,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:07:42,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 255776207, now seen corresponding path program 1 times [2025-01-09 00:07:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820565875] [2025-01-09 00:07:42,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:42,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 00:07:42,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 00:07:42,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:42,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820565875] [2025-01-09 00:07:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820565875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109336067] [2025-01-09 00:07:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:43,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:43,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:43,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:43,081 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-09 00:07:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:44,074 INFO L93 Difference]: Finished difference Result 3954 states and 5755 transitions. [2025-01-09 00:07:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 00:07:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:44,083 INFO L225 Difference]: With dead ends: 3954 [2025-01-09 00:07:44,083 INFO L226 Difference]: Without dead ends: 2636 [2025-01-09 00:07:44,085 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-09 00:07:44,085 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:44,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-01-09 00:07:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-01-09 00:07:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 0 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-09 00:07:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions. [2025-01-09 00:07:44,119 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 94 [2025-01-09 00:07:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:44,119 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions. [2025-01-09 00:07:44,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-09 00:07:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions. [2025-01-09 00:07:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 00:07:44,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:44,121 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:44,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:07:44,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:44,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 994089777, now seen corresponding path program 1 times [2025-01-09 00:07:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:44,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602366595] [2025-01-09 00:07:44,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 00:07:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 00:07:44,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 00:07:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:44,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602366595] [2025-01-09 00:07:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602366595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290616068] [2025-01-09 00:07:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:44,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:44,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:44,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:44,369 INFO L87 Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-09 00:07:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:45,563 INFO L93 Difference]: Finished difference Result 6586 states and 8545 transitions. [2025-01-09 00:07:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-01-09 00:07:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:45,584 INFO L225 Difference]: With dead ends: 6586 [2025-01-09 00:07:45,588 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:07:45,592 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-09 00:07:45,596 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:45,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:07:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:07:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:07:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 0 states have call successors, (0), 0 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-09 00:07:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions. [2025-01-09 00:07:45,696 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 212 [2025-01-09 00:07:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:45,697 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions. [2025-01-09 00:07:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-09 00:07:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions. [2025-01-09 00:07:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 00:07:45,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:45,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:07:45,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -139405010, now seen corresponding path program 1 times [2025-01-09 00:07:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155423761] [2025-01-09 00:07:45,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:45,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 00:07:45,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 00:07:45,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:45,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155423761] [2025-01-09 00:07:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155423761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239695541] [2025-01-09 00:07:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:46,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:46,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:46,210 INFO L87 Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-09 00:07:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:47,136 INFO L93 Difference]: Finished difference Result 8560 states and 10322 transitions. [2025-01-09 00:07:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-01-09 00:07:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:47,147 INFO L225 Difference]: With dead ends: 8560 [2025-01-09 00:07:47,147 INFO L226 Difference]: Without dead ends: 4610 [2025-01-09 00:07:47,151 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-09 00:07:47,152 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:47,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-01-09 00:07:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-01-09 00:07:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.1933174224343674) internal successors, (5500), 4609 states have internal predecessors, (5500), 0 states have call successors, (0), 0 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-09 00:07:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5500 transitions. [2025-01-09 00:07:47,216 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5500 transitions. Word has length 260 [2025-01-09 00:07:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:47,216 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 5500 transitions. [2025-01-09 00:07:47,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-09 00:07:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5500 transitions. [2025-01-09 00:07:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-09 00:07:47,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:47,220 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:47,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:07:47,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1769828183, now seen corresponding path program 1 times [2025-01-09 00:07:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295908287] [2025-01-09 00:07:47,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:47,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-09 00:07:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-09 00:07:47,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:47,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295908287] [2025-01-09 00:07:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295908287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:07:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834785009] [2025-01-09 00:07:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:07:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:07:47,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:47,718 INFO L87 Difference]: Start difference. First operand 4610 states and 5500 transitions. Second operand has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:49,171 INFO L93 Difference]: Finished difference Result 8419 states and 10151 transitions. [2025-01-09 00:07:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 00:07:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-01-09 00:07:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:49,181 INFO L225 Difference]: With dead ends: 8419 [2025-01-09 00:07:49,181 INFO L226 Difference]: Without dead ends: 4281 [2025-01-09 00:07:49,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:49,184 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:49,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:07:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-01-09 00:07:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-01-09 00:07:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.0761682242990653) internal successors, (4606), 4280 states have internal predecessors, (4606), 0 states have call successors, (0), 0 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-09 00:07:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4606 transitions. [2025-01-09 00:07:49,227 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4606 transitions. Word has length 347 [2025-01-09 00:07:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:49,227 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 4606 transitions. [2025-01-09 00:07:49,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4606 transitions. [2025-01-09 00:07:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 00:07:49,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:49,232 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:49,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:07:49,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1657167348, now seen corresponding path program 1 times [2025-01-09 00:07:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752542488] [2025-01-09 00:07:49,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:49,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 00:07:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 00:07:49,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:49,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 00:07:49,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:49,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752542488] [2025-01-09 00:07:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752542488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884183471] [2025-01-09 00:07:49,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:49,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:49,612 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-09 00:07:49,621 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-09 00:07:49,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 00:07:49,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 00:07:49,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:49,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:49,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:07:49,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 00:07:50,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:07:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884183471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:07:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-09 00:07:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952449804] [2025-01-09 00:07:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:50,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:50,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:07:50,096 INFO L87 Difference]: Start difference. First operand 4281 states and 4606 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-09 00:07:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:50,728 INFO L93 Difference]: Finished difference Result 5270 states and 5625 transitions. [2025-01-09 00:07:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2025-01-09 00:07:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:50,739 INFO L225 Difference]: With dead ends: 5270 [2025-01-09 00:07:50,739 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:07:50,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:07:50,741 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:50,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:07:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 4610. [2025-01-09 00:07:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0735517465827729) internal successors, (4948), 4609 states have internal predecessors, (4948), 0 states have call successors, (0), 0 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-09 00:07:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4948 transitions. [2025-01-09 00:07:50,783 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4948 transitions. Word has length 354 [2025-01-09 00:07:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:50,784 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4948 transitions. [2025-01-09 00:07:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-09 00:07:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4948 transitions. [2025-01-09 00:07:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-01-09 00:07:50,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:50,790 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:50,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:07:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:50,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:50,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1464178837, now seen corresponding path program 1 times [2025-01-09 00:07:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628581650] [2025-01-09 00:07:50,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:51,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-01-09 00:07:51,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-01-09 00:07:51,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:51,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-09 00:07:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628581650] [2025-01-09 00:07:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628581650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53243198] [2025-01-09 00:07:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:51,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:51,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:51,435 INFO L87 Difference]: Start difference. First operand 4610 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-09 00:07:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:52,176 INFO L93 Difference]: Finished difference Result 10863 states and 11778 transitions. [2025-01-09 00:07:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 553 [2025-01-09 00:07:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:52,196 INFO L225 Difference]: With dead ends: 10863 [2025-01-09 00:07:52,196 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:07:52,200 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-09 00:07:52,201 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:52,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 432 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:07:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2025-01-09 00:07:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0564236111111112) internal successors, (7302), 6912 states have internal predecessors, (7302), 0 states have call successors, (0), 0 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-09 00:07:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7302 transitions. [2025-01-09 00:07:52,306 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7302 transitions. Word has length 553 [2025-01-09 00:07:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:52,306 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7302 transitions. [2025-01-09 00:07:52,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-09 00:07:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7302 transitions. [2025-01-09 00:07:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 00:07:52,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:52,314 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:07:52,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash -842783232, now seen corresponding path program 1 times [2025-01-09 00:07:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053025152] [2025-01-09 00:07:52,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 00:07:52,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 00:07:52,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:52,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-01-09 00:07:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:52,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053025152] [2025-01-09 00:07:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053025152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616866196] [2025-01-09 00:07:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:52,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:52,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:52,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:52,584 INFO L87 Difference]: Start difference. First operand 6913 states and 7302 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-09 00:07:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:53,320 INFO L93 Difference]: Finished difference Result 15469 states and 16470 transitions. [2025-01-09 00:07:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 587 [2025-01-09 00:07:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:53,335 INFO L225 Difference]: With dead ends: 15469 [2025-01-09 00:07:53,335 INFO L226 Difference]: Without dead ends: 8887 [2025-01-09 00:07:53,340 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-09 00:07:53,341 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 176 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:53,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 420 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-01-09 00:07:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8229. [2025-01-09 00:07:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0542051531356345) internal successors, (8674), 8228 states have internal predecessors, (8674), 0 states have call successors, (0), 0 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-09 00:07:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8674 transitions. [2025-01-09 00:07:53,410 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8674 transitions. Word has length 587 [2025-01-09 00:07:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:53,410 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8674 transitions. [2025-01-09 00:07:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 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-09 00:07:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8674 transitions. [2025-01-09 00:07:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-01-09 00:07:53,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:53,418 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:07:53,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:07:53,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:53,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1277085031, now seen corresponding path program 1 times [2025-01-09 00:07:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140081748] [2025-01-09 00:07:53,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:53,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:53,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-01-09 00:07:53,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-01-09 00:07:53,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:53,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-09 00:07:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140081748] [2025-01-09 00:07:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140081748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264562338] [2025-01-09 00:07:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:53,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:53,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:53,744 INFO L87 Difference]: Start difference. First operand 8229 states and 8674 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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-09 00:07:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:54,505 INFO L93 Difference]: Finished difference Result 18430 states and 19568 transitions. [2025-01-09 00:07:54,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:54,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 746 [2025-01-09 00:07:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:54,542 INFO L225 Difference]: With dead ends: 18430 [2025-01-09 00:07:54,542 INFO L226 Difference]: Without dead ends: 10532 [2025-01-09 00:07:54,553 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-09 00:07:54,558 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:54,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 440 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10532 states. [2025-01-09 00:07:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 9874. [2025-01-09 00:07:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9874 states, 9873 states have (on average 1.0495290185353996) internal successors, (10362), 9873 states have internal predecessors, (10362), 0 states have call successors, (0), 0 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-09 00:07:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10362 transitions. [2025-01-09 00:07:54,719 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10362 transitions. Word has length 746 [2025-01-09 00:07:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:54,719 INFO L471 AbstractCegarLoop]: Abstraction has 9874 states and 10362 transitions. [2025-01-09 00:07:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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-09 00:07:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10362 transitions. [2025-01-09 00:07:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-01-09 00:07:54,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:54,735 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:07:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:07:54,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1570588573, now seen corresponding path program 1 times [2025-01-09 00:07:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668416476] [2025-01-09 00:07:54,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:54,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-01-09 00:07:54,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-01-09 00:07:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 00:07:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668416476] [2025-01-09 00:07:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668416476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:55,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458967418] [2025-01-09 00:07:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:55,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:55,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:55,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:55,410 INFO L87 Difference]: Start difference. First operand 9874 states and 10362 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-09 00:07:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:56,091 INFO L93 Difference]: Finished difference Result 24681 states and 25992 transitions. [2025-01-09 00:07:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:56,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 747 [2025-01-09 00:07:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:56,107 INFO L225 Difference]: With dead ends: 24681 [2025-01-09 00:07:56,108 INFO L226 Difference]: Without dead ends: 13164 [2025-01-09 00:07:56,115 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-09 00:07:56,116 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:56,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-01-09 00:07:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2025-01-09 00:07:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0408290478416706) internal successors, (13358), 12834 states have internal predecessors, (13358), 0 states have call successors, (0), 0 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-09 00:07:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13358 transitions. [2025-01-09 00:07:56,208 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13358 transitions. Word has length 747 [2025-01-09 00:07:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:56,209 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13358 transitions. [2025-01-09 00:07:56,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-09 00:07:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13358 transitions. [2025-01-09 00:07:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2025-01-09 00:07:56,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:56,282 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 00:07:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:07:56,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:56,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash -440316439, now seen corresponding path program 1 times [2025-01-09 00:07:56,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:56,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229489889] [2025-01-09 00:07:56,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1030 statements into 1 equivalence classes. [2025-01-09 00:07:56,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1030 of 1030 statements. [2025-01-09 00:07:56,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:56,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-01-09 00:07:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229489889] [2025-01-09 00:07:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229489889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:07:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007795666] [2025-01-09 00:07:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:57,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:07:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:57,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:07:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:07:57,228 INFO L87 Difference]: Start difference. First operand 12835 states and 13358 transitions. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 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-09 00:07:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:58,084 INFO L93 Difference]: Finished difference Result 25348 states and 26392 transitions. [2025-01-09 00:07:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:07:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 1030 [2025-01-09 00:07:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:58,100 INFO L225 Difference]: With dead ends: 25348 [2025-01-09 00:07:58,100 INFO L226 Difference]: Without dead ends: 12844 [2025-01-09 00:07:58,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:07:58,110 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:58,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2025-01-09 00:07:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12506. [2025-01-09 00:07:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0411835265893643) internal successors, (13020), 12505 states have internal predecessors, (13020), 0 states have call successors, (0), 0 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-09 00:07:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13020 transitions. [2025-01-09 00:07:58,197 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13020 transitions. Word has length 1030 [2025-01-09 00:07:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13020 transitions. [2025-01-09 00:07:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 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-09 00:07:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13020 transitions. [2025-01-09 00:07:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2025-01-09 00:07:58,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:58,210 INFO L218 NwaCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:07:58,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1291473292, now seen corresponding path program 1 times [2025-01-09 00:07:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100875690] [2025-01-09 00:07:58,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1087 statements into 1 equivalence classes. [2025-01-09 00:07:58,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1087 of 1087 statements. [2025-01-09 00:07:58,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1725 proven. 0 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-01-09 00:07:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100875690] [2025-01-09 00:07:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100875690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:58,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857170030] [2025-01-09 00:07:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:58,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:58,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:58,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:58,815 INFO L87 Difference]: Start difference. First operand 12506 states and 13020 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-09 00:07:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:59,585 INFO L93 Difference]: Finished difference Result 28960 states and 30159 transitions. [2025-01-09 00:07:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 1087 [2025-01-09 00:07:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:59,604 INFO L225 Difference]: With dead ends: 28960 [2025-01-09 00:07:59,605 INFO L226 Difference]: Without dead ends: 16785 [2025-01-09 00:07:59,615 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-09 00:07:59,616 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 194 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:59,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 432 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16785 states. [2025-01-09 00:07:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16785 to 16454. [2025-01-09 00:07:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.03701452622622) internal successors, (17062), 16453 states have internal predecessors, (17062), 0 states have call successors, (0), 0 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-09 00:07:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 17062 transitions. [2025-01-09 00:07:59,790 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 17062 transitions. Word has length 1087 [2025-01-09 00:07:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 17062 transitions. [2025-01-09 00:07:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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-09 00:07:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 17062 transitions. [2025-01-09 00:07:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2025-01-09 00:07:59,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:59,811 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:07:59,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:59,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1258537667, now seen corresponding path program 1 times [2025-01-09 00:07:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641386509] [2025-01-09 00:07:59,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:59,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1112 statements into 1 equivalence classes. [2025-01-09 00:07:59,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1112 of 1112 statements. [2025-01-09 00:07:59,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:59,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2633 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-01-09 00:08:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641386509] [2025-01-09 00:08:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641386509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:00,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774623656] [2025-01-09 00:08:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:00,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:00,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:00,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:00,546 INFO L87 Difference]: Start difference. First operand 16454 states and 17062 transitions. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-09 00:08:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:01,183 INFO L93 Difference]: Finished difference Result 33235 states and 34460 transitions. [2025-01-09 00:08:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:01,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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 1112 [2025-01-09 00:08:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:01,201 INFO L225 Difference]: With dead ends: 33235 [2025-01-09 00:08:01,201 INFO L226 Difference]: Without dead ends: 17112 [2025-01-09 00:08:01,212 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-09 00:08:01,213 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:01,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-01-09 00:08:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2025-01-09 00:08:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0358833498918825) internal successors, (17725), 17111 states have internal predecessors, (17725), 0 states have call successors, (0), 0 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-09 00:08:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17725 transitions. [2025-01-09 00:08:01,412 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17725 transitions. Word has length 1112 [2025-01-09 00:08:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17725 transitions. [2025-01-09 00:08:01,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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-09 00:08:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17725 transitions. [2025-01-09 00:08:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2025-01-09 00:08:01,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:01,427 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:08:01,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:01,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash -382968370, now seen corresponding path program 1 times [2025-01-09 00:08:01,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767201459] [2025-01-09 00:08:01,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:01,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1197 statements into 1 equivalence classes. [2025-01-09 00:08:01,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1197 of 1197 statements. [2025-01-09 00:08:01,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:01,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2801 backedges. 810 proven. 0 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2025-01-09 00:08:02,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:02,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767201459] [2025-01-09 00:08:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767201459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:02,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733344542] [2025-01-09 00:08:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:02,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:02,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:02,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:02,031 INFO L87 Difference]: Start difference. First operand 17112 states and 17725 transitions. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-09 00:08:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:02,745 INFO L93 Difference]: Finished difference Result 36196 states and 37524 transitions. [2025-01-09 00:08:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 1197 [2025-01-09 00:08:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:02,778 INFO L225 Difference]: With dead ends: 36196 [2025-01-09 00:08:02,781 INFO L226 Difference]: Without dead ends: 17770 [2025-01-09 00:08:02,801 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-09 00:08:02,801 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 209 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:02,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 410 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-01-09 00:08:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 16125. [2025-01-09 00:08:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.029273133217564) internal successors, (16596), 16124 states have internal predecessors, (16596), 0 states have call successors, (0), 0 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-09 00:08:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16596 transitions. [2025-01-09 00:08:02,985 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16596 transitions. Word has length 1197 [2025-01-09 00:08:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16596 transitions. [2025-01-09 00:08:02,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-09 00:08:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16596 transitions. [2025-01-09 00:08:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2025-01-09 00:08:03,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:03,002 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:08:03,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:03,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 370653590, now seen corresponding path program 1 times [2025-01-09 00:08:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762868788] [2025-01-09 00:08:03,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:03,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1277 statements into 1 equivalence classes. [2025-01-09 00:08:03,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1277 of 1277 statements. [2025-01-09 00:08:03,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:03,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3068 backedges. 2312 proven. 79 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-01-09 00:08:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762868788] [2025-01-09 00:08:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762868788] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692598277] [2025-01-09 00:08:04,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:04,610 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-09 00:08:04,612 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-09 00:08:04,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1277 statements into 1 equivalence classes. [2025-01-09 00:08:04,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1277 of 1277 statements. [2025-01-09 00:08:04,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:04,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:08:04,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3068 backedges. 1568 proven. 201 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2025-01-09 00:08:07,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3068 backedges. 1568 proven. 201 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2025-01-09 00:08:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692598277] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:08:10,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:08:10,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 00:08:10,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105936821] [2025-01-09 00:08:10,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:08:10,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 00:08:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:10,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 00:08:10,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:08:10,667 INFO L87 Difference]: Start difference. First operand 16125 states and 16596 transitions. Second operand has 8 states, 8 states have (on average 204.5) internal successors, (1636), 8 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-09 00:08:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:14,365 INFO L93 Difference]: Finished difference Result 38499 states and 39592 transitions. [2025-01-09 00:08:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 00:08:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 204.5) internal successors, (1636), 8 states have internal predecessors, (1636), 0 states have call successors, (0), 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 1277 [2025-01-09 00:08:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:14,386 INFO L225 Difference]: With dead ends: 38499 [2025-01-09 00:08:14,386 INFO L226 Difference]: Without dead ends: 22705 [2025-01-09 00:08:14,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2568 GetRequests, 2556 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-09 00:08:14,399 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1549 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6257 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 6257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:14,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 80 Invalid, 6613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 6257 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 00:08:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-01-09 00:08:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 19086. [2025-01-09 00:08:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19086 states, 19085 states have (on average 1.0268273513230286) internal successors, (19597), 19085 states have internal predecessors, (19597), 0 states have call successors, (0), 0 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-09 00:08:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19597 transitions. [2025-01-09 00:08:14,549 INFO L78 Accepts]: Start accepts. Automaton has 19086 states and 19597 transitions. Word has length 1277 [2025-01-09 00:08:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:14,549 INFO L471 AbstractCegarLoop]: Abstraction has 19086 states and 19597 transitions. [2025-01-09 00:08:14,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 204.5) internal successors, (1636), 8 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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-09 00:08:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 19086 states and 19597 transitions. [2025-01-09 00:08:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1308 [2025-01-09 00:08:14,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:14,565 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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-09 00:08:14,571 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-09 00:08:14,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 00:08:14,769 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:14,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2142300104, now seen corresponding path program 1 times [2025-01-09 00:08:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:14,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072223848] [2025-01-09 00:08:14,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1307 statements into 1 equivalence classes. [2025-01-09 00:08:14,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1307 of 1307 statements. [2025-01-09 00:08:14,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:14,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 1703 proven. 156 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2025-01-09 00:08:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072223848] [2025-01-09 00:08:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072223848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290887216] [2025-01-09 00:08:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:16,111 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-09 00:08:16,113 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-09 00:08:16,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1307 statements into 1 equivalence classes. [2025-01-09 00:08:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1307 of 1307 statements. [2025-01-09 00:08:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:16,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:08:16,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 1859 proven. 0 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2025-01-09 00:08:17,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290887216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:17,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:08:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778979759] [2025-01-09 00:08:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:17,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:17,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:17,212 INFO L87 Difference]: Start difference. First operand 19086 states and 19597 transitions. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 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-09 00:08:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:17,997 INFO L93 Difference]: Finished difference Result 39486 states and 40552 transitions. [2025-01-09 00:08:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 1307 [2025-01-09 00:08:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:18,016 INFO L225 Difference]: With dead ends: 39486 [2025-01-09 00:08:18,017 INFO L226 Difference]: Without dead ends: 20731 [2025-01-09 00:08:18,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1311 GetRequests, 1306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:18,030 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:18,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 91 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-01-09 00:08:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19415. [2025-01-09 00:08:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0250849902132482) internal successors, (19901), 19414 states have internal predecessors, (19901), 0 states have call successors, (0), 0 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-09 00:08:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19901 transitions. [2025-01-09 00:08:18,294 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19901 transitions. Word has length 1307 [2025-01-09 00:08:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:18,295 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19901 transitions. [2025-01-09 00:08:18,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 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-09 00:08:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19901 transitions. [2025-01-09 00:08:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1473 [2025-01-09 00:08:18,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:18,318 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:18,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:08:18,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:18,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1048755451, now seen corresponding path program 1 times [2025-01-09 00:08:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054113069] [2025-01-09 00:08:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:18,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-09 00:08:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-09 00:08:18,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3807 backedges. 2175 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2025-01-09 00:08:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054113069] [2025-01-09 00:08:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054113069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805163804] [2025-01-09 00:08:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:19,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:19,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:19,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:19,817 INFO L87 Difference]: Start difference. First operand 19415 states and 19901 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-09 00:08:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:20,465 INFO L93 Difference]: Finished difference Result 38499 states and 39469 transitions. [2025-01-09 00:08:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 1472 [2025-01-09 00:08:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:20,483 INFO L225 Difference]: With dead ends: 38499 [2025-01-09 00:08:20,484 INFO L226 Difference]: Without dead ends: 19415 [2025-01-09 00:08:20,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09 00:08:20,494 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:20,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 377 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-01-09 00:08:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18428. [2025-01-09 00:08:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.023226786780268) internal successors, (18855), 18427 states have internal predecessors, (18855), 0 states have call successors, (0), 0 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-09 00:08:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18855 transitions. [2025-01-09 00:08:20,718 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18855 transitions. Word has length 1472 [2025-01-09 00:08:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:20,719 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18855 transitions. [2025-01-09 00:08:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-09 00:08:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18855 transitions. [2025-01-09 00:08:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1795 [2025-01-09 00:08:20,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:20,814 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:08:20,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1956742382, now seen corresponding path program 1 times [2025-01-09 00:08:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161002660] [2025-01-09 00:08:20,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1794 statements into 1 equivalence classes. [2025-01-09 00:08:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1794 of 1794 statements. [2025-01-09 00:08:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 3974 proven. 896 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-01-09 00:08:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161002660] [2025-01-09 00:08:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161002660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414217781] [2025-01-09 00:08:24,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:24,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:24,287 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-09 00:08:24,288 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-09 00:08:24,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1794 statements into 1 equivalence classes. [2025-01-09 00:08:24,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1794 of 1794 statements. [2025-01-09 00:08:24,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:24,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:08:24,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5924 backedges. 2845 proven. 0 refuted. 0 times theorem prover too weak. 3079 trivial. 0 not checked. [2025-01-09 00:08:25,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414217781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2025-01-09 00:08:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283631490] [2025-01-09 00:08:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:25,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:25,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:08:25,282 INFO L87 Difference]: Start difference. First operand 18428 states and 18855 transitions. Second operand has 4 states, 4 states have (on average 191.5) internal successors, (766), 4 states have internal predecessors, (766), 0 states have call successors, (0), 0 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-09 00:08:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:26,211 INFO L93 Difference]: Finished difference Result 36525 states and 37377 transitions. [2025-01-09 00:08:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:08:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 191.5) internal successors, (766), 4 states have internal predecessors, (766), 0 states have call successors, (0), 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 1794 [2025-01-09 00:08:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:26,229 INFO L225 Difference]: With dead ends: 36525 [2025-01-09 00:08:26,229 INFO L226 Difference]: Without dead ends: 18428 [2025-01-09 00:08:26,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1804 GetRequests, 1793 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:08:26,238 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 274 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:26,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 396 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-01-09 00:08:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18428. [2025-01-09 00:08:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0229554458132089) internal successors, (18850), 18427 states have internal predecessors, (18850), 0 states have call successors, (0), 0 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-09 00:08:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18850 transitions. [2025-01-09 00:08:26,376 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18850 transitions. Word has length 1794 [2025-01-09 00:08:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:26,377 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18850 transitions. [2025-01-09 00:08:26,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 191.5) internal successors, (766), 4 states have internal predecessors, (766), 0 states have call successors, (0), 0 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-09 00:08:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18850 transitions. [2025-01-09 00:08:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2098 [2025-01-09 00:08:26,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:26,403 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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-09 00:08:26,413 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-09 00:08:26,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:26,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:26,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1216231177, now seen corresponding path program 1 times [2025-01-09 00:08:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702860281] [2025-01-09 00:08:26,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2097 statements into 1 equivalence classes. [2025-01-09 00:08:26,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2097 of 2097 statements. [2025-01-09 00:08:26,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:26,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8187 backedges. 4400 proven. 1734 refuted. 0 times theorem prover too weak. 2053 trivial. 0 not checked. [2025-01-09 00:08:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702860281] [2025-01-09 00:08:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702860281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577574646] [2025-01-09 00:08:29,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:29,914 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-09 00:08:29,915 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-09 00:08:30,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2097 statements into 1 equivalence classes. [2025-01-09 00:08:30,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2097 of 2097 statements. [2025-01-09 00:08:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:30,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 2399 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:08:30,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8187 backedges. 4376 proven. 0 refuted. 0 times theorem prover too weak. 3811 trivial. 0 not checked. [2025-01-09 00:08:30,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577574646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:30,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:30,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:08:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623567718] [2025-01-09 00:08:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:30,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:30,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:30,577 INFO L87 Difference]: Start difference. First operand 18428 states and 18850 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-09 00:08:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:31,194 INFO L93 Difference]: Finished difference Result 36854 states and 37700 transitions. [2025-01-09 00:08:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 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 2097 [2025-01-09 00:08:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:31,211 INFO L225 Difference]: With dead ends: 36854 [2025-01-09 00:08:31,211 INFO L226 Difference]: Without dead ends: 18757 [2025-01-09 00:08:31,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2102 GetRequests, 2098 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-09 00:08:31,222 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:31,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 433 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-01-09 00:08:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18428. [2025-01-09 00:08:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.022901177619797) internal successors, (18849), 18427 states have internal predecessors, (18849), 0 states have call successors, (0), 0 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-09 00:08:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18849 transitions. [2025-01-09 00:08:31,472 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18849 transitions. Word has length 2097 [2025-01-09 00:08:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:31,473 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18849 transitions. [2025-01-09 00:08:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-09 00:08:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18849 transitions. [2025-01-09 00:08:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2025-01-09 00:08:31,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:31,525 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 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, 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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:31,533 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-09 00:08:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:31,726 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1908488988, now seen corresponding path program 1 times [2025-01-09 00:08:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472757256] [2025-01-09 00:08:31,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:31,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2119 statements into 1 equivalence classes. [2025-01-09 00:08:31,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2119 of 2119 statements. [2025-01-09 00:08:31,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:31,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9068 backedges. 4229 proven. 523 refuted. 0 times theorem prover too weak. 4316 trivial. 0 not checked. [2025-01-09 00:08:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472757256] [2025-01-09 00:08:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472757256] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596209921] [2025-01-09 00:08:36,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:36,073 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-09 00:08:36,074 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-09 00:08:36,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2119 statements into 1 equivalence classes. [2025-01-09 00:08:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2119 of 2119 statements. [2025-01-09 00:08:36,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:36,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 2432 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 00:08:36,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9068 backedges. 7016 proven. 157 refuted. 0 times theorem prover too weak. 1895 trivial. 0 not checked. [2025-01-09 00:08:39,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9068 backedges. 6732 proven. 441 refuted. 0 times theorem prover too weak. 1895 trivial. 0 not checked. [2025-01-09 00:08:42,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596209921] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:08:42,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:08:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 00:08:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087802028] [2025-01-09 00:08:42,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:08:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 00:08:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:42,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 00:08:42,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 00:08:42,377 INFO L87 Difference]: Start difference. First operand 18428 states and 18849 transitions. Second operand has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-09 00:08:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:47,700 INFO L93 Difference]: Finished difference Result 37193 states and 38039 transitions. [2025-01-09 00:08:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:08:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 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 2119 [2025-01-09 00:08:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:47,723 INFO L225 Difference]: With dead ends: 37193 [2025-01-09 00:08:47,724 INFO L226 Difference]: Without dead ends: 19096 [2025-01-09 00:08:47,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4253 GetRequests, 4236 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-01-09 00:08:47,738 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1128 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12363 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 12421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 12363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:47,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 174 Invalid, 12421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 12363 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:08:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19096 states. [2025-01-09 00:08:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19096 to 18428. [2025-01-09 00:08:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0218158137515603) internal successors, (18829), 18427 states have internal predecessors, (18829), 0 states have call successors, (0), 0 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-09 00:08:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18829 transitions. [2025-01-09 00:08:47,893 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18829 transitions. Word has length 2119 [2025-01-09 00:08:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:47,894 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18829 transitions. [2025-01-09 00:08:47,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 0 states have call successors, (0), 0 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-09 00:08:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18829 transitions. [2025-01-09 00:08:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2229 [2025-01-09 00:08:47,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:47,925 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:08:47,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:08:48,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 00:08:48,130 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash 428778583, now seen corresponding path program 1 times [2025-01-09 00:08:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055885829] [2025-01-09 00:08:48,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:48,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2228 statements into 1 equivalence classes. [2025-01-09 00:08:48,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2228 of 2228 statements. [2025-01-09 00:08:48,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:48,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10015 backedges. 5861 proven. 20 refuted. 0 times theorem prover too weak. 4134 trivial. 0 not checked. [2025-01-09 00:08:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055885829] [2025-01-09 00:08:49,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055885829] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:49,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702247080] [2025-01-09 00:08:49,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:49,458 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-09 00:08:49,458 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-09 00:08:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2228 statements into 1 equivalence classes. [2025-01-09 00:08:49,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2228 of 2228 statements. [2025-01-09 00:08:49,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:49,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:49,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 2562 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:49,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10015 backedges. 2085 proven. 0 refuted. 0 times theorem prover too weak. 7930 trivial. 0 not checked. [2025-01-09 00:08:50,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702247080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:50,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:08:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619374928] [2025-01-09 00:08:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:50,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:50,127 INFO L87 Difference]: Start difference. First operand 18428 states and 18829 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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-09 00:08:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:50,704 INFO L93 Difference]: Finished difference Result 36525 states and 37319 transitions. [2025-01-09 00:08:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 2228 [2025-01-09 00:08:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:50,726 INFO L225 Difference]: With dead ends: 36525 [2025-01-09 00:08:50,727 INFO L226 Difference]: Without dead ends: 18099 [2025-01-09 00:08:50,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2233 GetRequests, 2228 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-09 00:08:50,739 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 50 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:50,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 416 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:08:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-01-09 00:08:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 17770. [2025-01-09 00:08:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.0160391693398616) internal successors, (18054), 17769 states have internal predecessors, (18054), 0 states have call successors, (0), 0 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-09 00:08:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18054 transitions. [2025-01-09 00:08:50,859 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18054 transitions. Word has length 2228 [2025-01-09 00:08:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:50,860 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18054 transitions. [2025-01-09 00:08:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 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-09 00:08:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18054 transitions. [2025-01-09 00:08:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2315 [2025-01-09 00:08:50,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:50,888 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:50,896 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-09 00:08:51,092 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-09 00:08:51,092 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:51,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1434783401, now seen corresponding path program 1 times [2025-01-09 00:08:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969903963] [2025-01-09 00:08:51,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2314 statements into 1 equivalence classes. [2025-01-09 00:08:51,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2314 of 2314 statements. [2025-01-09 00:08:51,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:51,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11614 backedges. 8339 proven. 91 refuted. 0 times theorem prover too weak. 3184 trivial. 0 not checked. [2025-01-09 00:08:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969903963] [2025-01-09 00:08:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969903963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459733254] [2025-01-09 00:08:53,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:53,586 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-09 00:08:53,587 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-09 00:08:53,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2314 statements into 1 equivalence classes. [2025-01-09 00:08:54,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2314 of 2314 statements. [2025-01-09 00:08:54,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:54,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:54,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:54,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11614 backedges. 3684 proven. 0 refuted. 0 times theorem prover too weak. 7930 trivial. 0 not checked. [2025-01-09 00:08:54,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459733254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:08:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118953459] [2025-01-09 00:08:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:54,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:54,337 INFO L87 Difference]: Start difference. First operand 17770 states and 18054 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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-09 00:08:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:55,049 INFO L93 Difference]: Finished difference Result 36854 states and 37441 transitions. [2025-01-09 00:08:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:55,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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 2314 [2025-01-09 00:08:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:55,087 INFO L225 Difference]: With dead ends: 36854 [2025-01-09 00:08:55,088 INFO L226 Difference]: Without dead ends: 19415 [2025-01-09 00:08:55,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2319 GetRequests, 2314 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-09 00:08:55,100 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:55,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 41 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-01-09 00:08:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18099. [2025-01-09 00:08:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0154713227980992) internal successors, (18378), 18098 states have internal predecessors, (18378), 0 states have call successors, (0), 0 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-09 00:08:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18378 transitions. [2025-01-09 00:08:55,284 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18378 transitions. Word has length 2314 [2025-01-09 00:08:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18378 transitions. [2025-01-09 00:08:55,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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-09 00:08:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18378 transitions. [2025-01-09 00:08:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2381 [2025-01-09 00:08:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:55,314 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-09 00:08:55,323 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-09 00:08:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:55,518 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash 220443854, now seen corresponding path program 1 times [2025-01-09 00:08:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712439219] [2025-01-09 00:08:55,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:55,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2380 statements into 1 equivalence classes. [2025-01-09 00:08:55,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2380 of 2380 statements. [2025-01-09 00:08:55,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:55,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11918 backedges. 8524 proven. 91 refuted. 0 times theorem prover too weak. 3303 trivial. 0 not checked. [2025-01-09 00:08:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712439219] [2025-01-09 00:08:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712439219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478188515] [2025-01-09 00:08:58,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:58,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:08:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 00:08:58,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2380 statements into 1 equivalence classes. [2025-01-09 00:08:58,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2380 of 2380 statements. [2025-01-09 00:08:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:58,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 2735 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:08:58,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11918 backedges. 7193 proven. 0 refuted. 0 times theorem prover too weak. 4725 trivial. 0 not checked. [2025-01-09 00:08:59,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478188515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:08:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83396802] [2025-01-09 00:08:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:59,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:08:59,084 INFO L87 Difference]: Start difference. First operand 18099 states and 18378 transitions. Second operand has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-09 00:09:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:00,037 INFO L93 Difference]: Finished difference Result 36854 states and 37430 transitions. [2025-01-09 00:09:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 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 2380 [2025-01-09 00:09:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:00,056 INFO L225 Difference]: With dead ends: 36854 [2025-01-09 00:09:00,056 INFO L226 Difference]: Without dead ends: 19086 [2025-01-09 00:09:00,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2385 GetRequests, 2379 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:09:00,068 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 733 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:00,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 57 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:09:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-01-09 00:09:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 18757. [2025-01-09 00:09:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0155683514608658) internal successors, (19048), 18756 states have internal predecessors, (19048), 0 states have call successors, (0), 0 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-09 00:09:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19048 transitions. [2025-01-09 00:09:00,205 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19048 transitions. Word has length 2380 [2025-01-09 00:09:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:00,209 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19048 transitions. [2025-01-09 00:09:00,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-09 00:09:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19048 transitions. [2025-01-09 00:09:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2510 [2025-01-09 00:09:00,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:00,242 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:00,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 00:09:00,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:00,447 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:00,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -470247835, now seen corresponding path program 1 times [2025-01-09 00:09:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:00,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655566101] [2025-01-09 00:09:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2509 statements into 1 equivalence classes. [2025-01-09 00:09:00,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2509 of 2509 statements. [2025-01-09 00:09:00,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:00,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12802 backedges. 9008 proven. 91 refuted. 0 times theorem prover too weak. 3703 trivial. 0 not checked. [2025-01-09 00:09:03,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655566101] [2025-01-09 00:09:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655566101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146467903] [2025-01-09 00:09:03,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:03,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:03,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:03,405 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:03,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 00:09:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2509 statements into 1 equivalence classes. [2025-01-09 00:09:03,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2509 of 2509 statements. [2025-01-09 00:09:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:03,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:09:03,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12802 backedges. 8077 proven. 0 refuted. 0 times theorem prover too weak. 4725 trivial. 0 not checked. [2025-01-09 00:09:04,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:04,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146467903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:04,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:09:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545622093] [2025-01-09 00:09:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:04,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:04,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:04,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:09:04,206 INFO L87 Difference]: Start difference. First operand 18757 states and 19048 transitions. Second operand has 4 states, 4 states have (on average 209.25) internal successors, (837), 4 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)