./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i -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 8b0d381d265ef579b87dc204e4bf201472b6c1640922289c165a4e9815d5548b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:34:59,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:34:59,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:34:59,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:34:59,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:34:59,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:34:59,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:34:59,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:34:59,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:34:59,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:34:59,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:34:59,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:34:59,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:34:59,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:34:59,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:34:59,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:59,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:34:59,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:34:59,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:34:59,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:34:59,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:34:59,571 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 -> 8b0d381d265ef579b87dc204e4bf201472b6c1640922289c165a4e9815d5548b [2025-02-05 21:34:59,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:34:59,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:34:59,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:34:59,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:34:59,844 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:34:59,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i [2025-02-05 21:35:01,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4206d0998/e8bc22e73a194b58909213ca075ce0db/FLAGfc5de313b [2025-02-05 21:35:01,447 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:35:01,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i [2025-02-05 21:35:01,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4206d0998/e8bc22e73a194b58909213ca075ce0db/FLAGfc5de313b [2025-02-05 21:35:01,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4206d0998/e8bc22e73a194b58909213ca075ce0db [2025-02-05 21:35:01,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:35:01,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:35:01,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:35:01,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:35:01,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:35:01,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:01,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0c977c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01, skipping insertion in model container [2025-02-05 21:35:01,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:01,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:35:01,665 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i[916,929] [2025-02-05 21:35:01,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:35:01,806 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:35:01,815 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-39.i[916,929] [2025-02-05 21:35:01,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:35:01,908 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:35:01,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01 WrapperNode [2025-02-05 21:35:01,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:35:01,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:35:01,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:35:01,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:35:01,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:01,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:01,985 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-02-05 21:35:01,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:35:01,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:35:01,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:35:01,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:35:01,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:01,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:35:02,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:35:02,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:35:02,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:35:02,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:35:02,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (1/1) ... [2025-02-05 21:35:02,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:35:02,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:02,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:35:02,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:35:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:35:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:35:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:35:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:35:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:35:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:35:02,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:35:02,283 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:35:03,070 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc property_#t~bitwise56#1; [2025-02-05 21:35:03,172 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:35:03,172 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:35:03,206 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:35:03,208 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:35:03,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:35:03 BoogieIcfgContainer [2025-02-05 21:35:03,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:35:03,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:35:03,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:35:03,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:35:03,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:35:01" (1/3) ... [2025-02-05 21:35:03,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e385324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:35:03, skipping insertion in model container [2025-02-05 21:35:03,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:35:01" (2/3) ... [2025-02-05 21:35:03,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e385324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:35:03, skipping insertion in model container [2025-02-05 21:35:03,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:35:03" (3/3) ... [2025-02-05 21:35:03,219 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-39.i [2025-02-05 21:35:03,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:35:03,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-39.i that has 2 procedures, 230 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:35:03,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:35:03,305 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;@5ee67dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:35:03,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:35:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 152 states have (on average 1.519736842105263) internal successors, (231), 153 states have internal predecessors, (231), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 21:35:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:35:03,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:03,337 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:03,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1273239652, now seen corresponding path program 1 times [2025-02-05 21:35:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116394553] [2025-02-05 21:35:03,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:03,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:35:03,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:35:03,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:03,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-05 21:35:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116394553] [2025-02-05 21:35:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116394553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174670107] [2025-02-05 21:35:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:03,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:04,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:35:04,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:35:04,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:35:04,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:35:04,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-05 21:35:04,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:35:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174670107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:04,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:35:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:35:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542795445] [2025-02-05 21:35:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:04,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:35:04,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:04,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:35:04,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:35:04,407 INFO L87 Difference]: Start difference. First operand has 230 states, 152 states have (on average 1.519736842105263) internal successors, (231), 153 states have internal predecessors, (231), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:04,502 INFO L93 Difference]: Finished difference Result 454 states and 832 transitions. [2025-02-05 21:35:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:35:04,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 476 [2025-02-05 21:35:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:04,516 INFO L225 Difference]: With dead ends: 454 [2025-02-05 21:35:04,516 INFO L226 Difference]: Without dead ends: 227 [2025-02-05 21:35:04,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:35:04,525 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:04,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:35:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-05 21:35:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-02-05 21:35:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 150 states have (on average 1.5) internal successors, (225), 150 states have internal predecessors, (225), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 21:35:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 375 transitions. [2025-02-05 21:35:04,603 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 375 transitions. Word has length 476 [2025-02-05 21:35:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 375 transitions. [2025-02-05 21:35:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 375 transitions. [2025-02-05 21:35:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:35:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:04,615 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:04,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:35:04,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:35:04,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:04,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash -122128711, now seen corresponding path program 1 times [2025-02-05 21:35:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295142034] [2025-02-05 21:35:04,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:04,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:04,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:35:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:35:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:05,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295142034] [2025-02-05 21:35:05,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295142034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:05,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417701272] [2025-02-05 21:35:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:05,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:05,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:05,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:05,374 INFO L87 Difference]: Start difference. First operand 227 states and 375 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:05,490 INFO L93 Difference]: Finished difference Result 581 states and 964 transitions. [2025-02-05 21:35:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:05,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-02-05 21:35:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:05,497 INFO L225 Difference]: With dead ends: 581 [2025-02-05 21:35:05,497 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 21:35:05,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:05,502 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 207 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:05,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 760 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:35:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 21:35:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-02-05 21:35:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 260 states have (on average 1.5538461538461539) internal successors, (404), 261 states have internal predecessors, (404), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 21:35:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 586 transitions. [2025-02-05 21:35:05,588 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 586 transitions. Word has length 476 [2025-02-05 21:35:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:05,591 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 586 transitions. [2025-02-05 21:35:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 586 transitions. [2025-02-05 21:35:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:35:05,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:05,600 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:35:05,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash -244936169, now seen corresponding path program 1 times [2025-02-05 21:35:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789837131] [2025-02-05 21:35:05,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:35:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:35:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789837131] [2025-02-05 21:35:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789837131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:06,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061241959] [2025-02-05 21:35:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:06,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:06,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:06,073 INFO L87 Difference]: Start difference. First operand 354 states and 586 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:06,200 INFO L93 Difference]: Finished difference Result 951 states and 1570 transitions. [2025-02-05 21:35:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-02-05 21:35:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:06,210 INFO L225 Difference]: With dead ends: 951 [2025-02-05 21:35:06,212 INFO L226 Difference]: Without dead ends: 600 [2025-02-05 21:35:06,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:06,215 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 233 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:06,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 814 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:35:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-05 21:35:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2025-02-05 21:35:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 440 states have (on average 1.5386363636363636) internal successors, (677), 443 states have internal predecessors, (677), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-05 21:35:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 981 transitions. [2025-02-05 21:35:06,296 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 981 transitions. Word has length 476 [2025-02-05 21:35:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:06,299 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 981 transitions. [2025-02-05 21:35:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 981 transitions. [2025-02-05 21:35:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:35:06,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:06,309 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:35:06,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1972821784, now seen corresponding path program 1 times [2025-02-05 21:35:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789890701] [2025-02-05 21:35:06,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:35:06,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:35:06,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:06,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789890701] [2025-02-05 21:35:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789890701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270407770] [2025-02-05 21:35:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:06,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:06,733 INFO L87 Difference]: Start difference. First operand 597 states and 981 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:06,796 INFO L93 Difference]: Finished difference Result 1195 states and 1967 transitions. [2025-02-05 21:35:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-02-05 21:35:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:06,804 INFO L225 Difference]: With dead ends: 1195 [2025-02-05 21:35:06,804 INFO L226 Difference]: Without dead ends: 601 [2025-02-05 21:35:06,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:06,809 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:06,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:35:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-05 21:35:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-02-05 21:35:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 444 states have (on average 1.5337837837837838) internal successors, (681), 447 states have internal predecessors, (681), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-05 21:35:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 985 transitions. [2025-02-05 21:35:06,879 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 985 transitions. Word has length 476 [2025-02-05 21:35:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 985 transitions. [2025-02-05 21:35:06,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 985 transitions. [2025-02-05 21:35:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 21:35:06,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:06,902 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:35:06,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1948426653, now seen corresponding path program 1 times [2025-02-05 21:35:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861602920] [2025-02-05 21:35:06,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:06,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:35:06,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:35:06,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861602920] [2025-02-05 21:35:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861602920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:07,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682993012] [2025-02-05 21:35:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:07,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:07,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:07,365 INFO L87 Difference]: Start difference. First operand 601 states and 985 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:07,432 INFO L93 Difference]: Finished difference Result 1201 states and 1971 transitions. [2025-02-05 21:35:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 477 [2025-02-05 21:35:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:07,438 INFO L225 Difference]: With dead ends: 1201 [2025-02-05 21:35:07,438 INFO L226 Difference]: Without dead ends: 603 [2025-02-05 21:35:07,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:07,440 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:07,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:35:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-05 21:35:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-02-05 21:35:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 446 states have (on average 1.531390134529148) internal successors, (683), 449 states have internal predecessors, (683), 152 states have call successors, (152), 4 states have call predecessors, (152), 4 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-05 21:35:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 987 transitions. [2025-02-05 21:35:07,498 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 987 transitions. Word has length 477 [2025-02-05 21:35:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:07,501 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 987 transitions. [2025-02-05 21:35:07,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 987 transitions. [2025-02-05 21:35:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 21:35:07,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:07,511 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:35:07,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -863345551, now seen corresponding path program 1 times [2025-02-05 21:35:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618606823] [2025-02-05 21:35:07,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:07,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 21:35:07,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 21:35:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618606823] [2025-02-05 21:35:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618606823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:35:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586754225] [2025-02-05 21:35:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:08,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:35:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:08,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:35:08,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:08,224 INFO L87 Difference]: Start difference. First operand 603 states and 987 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:08,365 INFO L93 Difference]: Finished difference Result 1803 states and 2955 transitions. [2025-02-05 21:35:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:35:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-02-05 21:35:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:08,377 INFO L225 Difference]: With dead ends: 1803 [2025-02-05 21:35:08,378 INFO L226 Difference]: Without dead ends: 1203 [2025-02-05 21:35:08,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:35:08,381 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 226 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:08,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 776 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:35:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-02-05 21:35:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1199. [2025-02-05 21:35:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 886 states have (on average 1.528216704288939) internal successors, (1354), 892 states have internal predecessors, (1354), 304 states have call successors, (304), 8 states have call predecessors, (304), 8 states have return successors, (304), 298 states have call predecessors, (304), 304 states have call successors, (304) [2025-02-05 21:35:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1962 transitions. [2025-02-05 21:35:08,504 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1962 transitions. Word has length 478 [2025-02-05 21:35:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:08,505 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1962 transitions. [2025-02-05 21:35:08,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1962 transitions. [2025-02-05 21:35:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:35:08,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:08,515 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:35:08,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1639993037, now seen corresponding path program 1 times [2025-02-05 21:35:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:08,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978722933] [2025-02-05 21:35:08,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:08,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:35:08,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:35:08,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:08,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978722933] [2025-02-05 21:35:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978722933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:35:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296594934] [2025-02-05 21:35:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:35:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:08,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:35:08,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:08,948 INFO L87 Difference]: Start difference. First operand 1199 states and 1962 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:09,485 INFO L93 Difference]: Finished difference Result 3595 states and 5888 transitions. [2025-02-05 21:35:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:35:09,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 479 [2025-02-05 21:35:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:09,504 INFO L225 Difference]: With dead ends: 3595 [2025-02-05 21:35:09,505 INFO L226 Difference]: Without dead ends: 2399 [2025-02-05 21:35:09,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:09,511 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 247 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:09,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 901 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:35:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2025-02-05 21:35:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2397. [2025-02-05 21:35:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 1772 states have (on average 1.528216704288939) internal successors, (2708), 1784 states have internal predecessors, (2708), 608 states have call successors, (608), 16 states have call predecessors, (608), 16 states have return successors, (608), 596 states have call predecessors, (608), 608 states have call successors, (608) [2025-02-05 21:35:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3924 transitions. [2025-02-05 21:35:09,763 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3924 transitions. Word has length 479 [2025-02-05 21:35:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3924 transitions. [2025-02-05 21:35:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3924 transitions. [2025-02-05 21:35:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:35:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:09,772 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:35:09,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:09,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1812673245, now seen corresponding path program 1 times [2025-02-05 21:35:09,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876752300] [2025-02-05 21:35:09,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:09,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:35:10,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:35:10,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:10,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 150 proven. 72 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:35:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876752300] [2025-02-05 21:35:10,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876752300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364934078] [2025-02-05 21:35:10,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:10,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:10,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:10,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:10,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:35:10,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:35:10,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:35:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:10,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:11,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 4974 proven. 72 refuted. 0 times theorem prover too weak. 6054 trivial. 0 not checked. [2025-02-05 21:35:12,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 150 proven. 72 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:35:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364934078] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:12,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-02-05 21:35:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920928826] [2025-02-05 21:35:12,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:12,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:35:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:12,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:35:12,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:35:12,960 INFO L87 Difference]: Start difference. First operand 2397 states and 3924 transitions. Second operand has 14 states, 14 states have (on average 18.142857142857142) internal successors, (254), 14 states have internal predecessors, (254), 6 states have call successors, (225), 3 states have call predecessors, (225), 6 states have return successors, (225), 6 states have call predecessors, (225), 6 states have call successors, (225) [2025-02-05 21:35:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:16,137 INFO L93 Difference]: Finished difference Result 15545 states and 25221 transitions. [2025-02-05 21:35:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 21:35:16,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.142857142857142) internal successors, (254), 14 states have internal predecessors, (254), 6 states have call successors, (225), 3 states have call predecessors, (225), 6 states have return successors, (225), 6 states have call predecessors, (225), 6 states have call successors, (225) Word has length 479 [2025-02-05 21:35:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:16,255 INFO L225 Difference]: With dead ends: 15545 [2025-02-05 21:35:16,255 INFO L226 Difference]: Without dead ends: 13151 [2025-02-05 21:35:16,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 954 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:35:16,267 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 1590 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:16,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 2635 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 21:35:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-02-05 21:35:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 9403. [2025-02-05 21:35:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9403 states, 6792 states have (on average 1.4961719670200235) internal successors, (10162), 6854 states have internal predecessors, (10162), 2536 states have call successors, (2536), 74 states have call predecessors, (2536), 74 states have return successors, (2536), 2474 states have call predecessors, (2536), 2536 states have call successors, (2536) [2025-02-05 21:35:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9403 states to 9403 states and 15234 transitions. [2025-02-05 21:35:17,382 INFO L78 Accepts]: Start accepts. Automaton has 9403 states and 15234 transitions. Word has length 479 [2025-02-05 21:35:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:17,383 INFO L471 AbstractCegarLoop]: Abstraction has 9403 states and 15234 transitions. [2025-02-05 21:35:17,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.142857142857142) internal successors, (254), 14 states have internal predecessors, (254), 6 states have call successors, (225), 3 states have call predecessors, (225), 6 states have return successors, (225), 6 states have call predecessors, (225), 6 states have call successors, (225) [2025-02-05 21:35:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 9403 states and 15234 transitions. [2025-02-05 21:35:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:35:17,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:17,405 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:17,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:35:17,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:17,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash 970648272, now seen corresponding path program 1 times [2025-02-05 21:35:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:17,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368366844] [2025-02-05 21:35:17,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:35:17,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:35:17,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:17,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-05 21:35:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368366844] [2025-02-05 21:35:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368366844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:35:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703091661] [2025-02-05 21:35:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:35:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:17,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:35:17,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:17,893 INFO L87 Difference]: Start difference. First operand 9403 states and 15234 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:19,160 INFO L93 Difference]: Finished difference Result 23707 states and 38221 transitions. [2025-02-05 21:35:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:35:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 480 [2025-02-05 21:35:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:19,286 INFO L225 Difference]: With dead ends: 23707 [2025-02-05 21:35:19,286 INFO L226 Difference]: Without dead ends: 19611 [2025-02-05 21:35:19,303 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-02-05 21:35:19,304 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 701 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:19,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1319 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:35:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2025-02-05 21:35:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 14550. [2025-02-05 21:35:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14550 states, 10957 states have (on average 1.512731587113261) internal successors, (16575), 11072 states have internal predecessors, (16575), 3465 states have call successors, (3465), 127 states have call predecessors, (3465), 127 states have return successors, (3465), 3350 states have call predecessors, (3465), 3465 states have call successors, (3465) [2025-02-05 21:35:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14550 states to 14550 states and 23505 transitions. [2025-02-05 21:35:20,562 INFO L78 Accepts]: Start accepts. Automaton has 14550 states and 23505 transitions. Word has length 480 [2025-02-05 21:35:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:20,564 INFO L471 AbstractCegarLoop]: Abstraction has 14550 states and 23505 transitions. [2025-02-05 21:35:20,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-05 21:35:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14550 states and 23505 transitions. [2025-02-05 21:35:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:35:20,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:20,578 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:20,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:35:20,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:20,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1408657775, now seen corresponding path program 1 times [2025-02-05 21:35:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899234804] [2025-02-05 21:35:20,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:20,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:35:20,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:35:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:20,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 150 proven. 72 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:35:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899234804] [2025-02-05 21:35:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899234804] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467212186] [2025-02-05 21:35:21,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:21,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:21,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:35:21,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:35:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:35:21,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:21,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:35:21,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 4974 proven. 72 refuted. 0 times theorem prover too weak. 6054 trivial. 0 not checked. [2025-02-05 21:35:21,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 150 proven. 72 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-05 21:35:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467212186] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:22,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 21:35:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239454304] [2025-02-05 21:35:22,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:22,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:35:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:22,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:35:22,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:35:22,419 INFO L87 Difference]: Start difference. First operand 14550 states and 23505 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-02-05 21:35:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:24,605 INFO L93 Difference]: Finished difference Result 30472 states and 49221 transitions. [2025-02-05 21:35:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:35:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) Word has length 480 [2025-02-05 21:35:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:24,697 INFO L225 Difference]: With dead ends: 30472 [2025-02-05 21:35:24,697 INFO L226 Difference]: Without dead ends: 17625 [2025-02-05 21:35:24,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:35:24,742 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1225 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:24,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1731 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:35:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17625 states. [2025-02-05 21:35:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17625 to 9369. [2025-02-05 21:35:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9369 states, 7256 states have (on average 1.534316427783903) internal successors, (11133), 7320 states have internal predecessors, (11133), 2030 states have call successors, (2030), 82 states have call predecessors, (2030), 82 states have return successors, (2030), 1966 states have call predecessors, (2030), 2030 states have call successors, (2030) [2025-02-05 21:35:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 15193 transitions. [2025-02-05 21:35:25,798 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 15193 transitions. Word has length 480 [2025-02-05 21:35:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 9369 states and 15193 transitions. [2025-02-05 21:35:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-02-05 21:35:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 15193 transitions. [2025-02-05 21:35:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:35:25,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:25,808 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:25,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:35:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:26,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1938489163, now seen corresponding path program 1 times [2025-02-05 21:35:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883253492] [2025-02-05 21:35:26,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:26,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:35:26,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:35:26,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:35:26,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141947734] [2025-02-05 21:35:26,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:26,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:26,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:26,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:35:26,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:35:26,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:35:26,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:26,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:26,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:26,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2972 proven. 33 refuted. 0 times theorem prover too weak. 8095 trivial. 0 not checked. [2025-02-05 21:35:27,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883253492] [2025-02-05 21:35:28,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:35:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141947734] [2025-02-05 21:35:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141947734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:28,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:35:28,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-02-05 21:35:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015072796] [2025-02-05 21:35:28,181 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:28,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:35:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:28,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:35:28,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:35:28,182 INFO L87 Difference]: Start difference. First operand 9369 states and 15193 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:29,485 INFO L93 Difference]: Finished difference Result 28281 states and 45745 transitions. [2025-02-05 21:35:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:35:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 480 [2025-02-05 21:35:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:29,582 INFO L225 Difference]: With dead ends: 28281 [2025-02-05 21:35:29,582 INFO L226 Difference]: Without dead ends: 18915 [2025-02-05 21:35:29,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:35:29,620 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 405 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:29,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1286 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:35:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2025-02-05 21:35:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 18765. [2025-02-05 21:35:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18765 states, 14532 states have (on average 1.528075970272502) internal successors, (22206), 14660 states have internal predecessors, (22206), 4060 states have call successors, (4060), 172 states have call predecessors, (4060), 172 states have return successors, (4060), 3932 states have call predecessors, (4060), 4060 states have call successors, (4060) [2025-02-05 21:35:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18765 states to 18765 states and 30326 transitions. [2025-02-05 21:35:31,418 INFO L78 Accepts]: Start accepts. Automaton has 18765 states and 30326 transitions. Word has length 480 [2025-02-05 21:35:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:31,419 INFO L471 AbstractCegarLoop]: Abstraction has 18765 states and 30326 transitions. [2025-02-05 21:35:31,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18765 states and 30326 transitions. [2025-02-05 21:35:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:35:31,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:31,430 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:31,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:35:31,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 21:35:31,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:31,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 733490272, now seen corresponding path program 1 times [2025-02-05 21:35:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690384071] [2025-02-05 21:35:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:31,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:35:31,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:35:31,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:31,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:35:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849453266] [2025-02-05 21:35:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:31,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:31,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:31,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:35:32,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:35:32,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:35:32,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:32,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:32,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2972 proven. 33 refuted. 0 times theorem prover too weak. 8095 trivial. 0 not checked. [2025-02-05 21:35:32,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:36,824 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_z_9 Int) (v_y_9 Int)) (let ((.cse0 (+ (* v_y_9 2147483648) (* v_z_9 1116691497)))) (or (< .cse0 0) (< v_z_9 (+ (mod c_~var_1_68~0 65536) 1)) (< 2147483647 v_z_9) (< 255 .cse0)))) is different from false [2025-02-05 21:35:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690384071] [2025-02-05 21:35:37,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:35:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849453266] [2025-02-05 21:35:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849453266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:37,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:35:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-05 21:35:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500830248] [2025-02-05 21:35:37,330 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:35:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:37,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:35:37,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2025-02-05 21:35:37,332 INFO L87 Difference]: Start difference. First operand 18765 states and 30326 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:39,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:39,147 INFO L93 Difference]: Finished difference Result 34621 states and 55569 transitions. [2025-02-05 21:35:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:35:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 481 [2025-02-05 21:35:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:39,257 INFO L225 Difference]: With dead ends: 34621 [2025-02-05 21:35:39,257 INFO L226 Difference]: Without dead ends: 25255 [2025-02-05 21:35:39,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=56, Invalid=103, Unknown=1, NotChecked=22, Total=182 [2025-02-05 21:35:39,285 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 459 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:39,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1355 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:35:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25255 states. [2025-02-05 21:35:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25255 to 24829. [2025-02-05 21:35:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24829 states, 18980 states have (on average 1.51159114857745) internal successors, (28690), 19164 states have internal predecessors, (28690), 5600 states have call successors, (5600), 248 states have call predecessors, (5600), 248 states have return successors, (5600), 5416 states have call predecessors, (5600), 5600 states have call successors, (5600) [2025-02-05 21:35:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 39890 transitions. [2025-02-05 21:35:41,211 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 39890 transitions. Word has length 481 [2025-02-05 21:35:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:41,212 INFO L471 AbstractCegarLoop]: Abstraction has 24829 states and 39890 transitions. [2025-02-05 21:35:41,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-05 21:35:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 39890 transitions. [2025-02-05 21:35:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:35:41,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:41,223 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:35:41,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 21:35:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 21:35:41,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1333959837, now seen corresponding path program 1 times [2025-02-05 21:35:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922546005] [2025-02-05 21:35:41,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:41,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:35:41,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:35:41,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:41,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:35:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217754977] [2025-02-05 21:35:41,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:41,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:41,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:35:41,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:35:42,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:35:42,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:35:42,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:42,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:42,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 21:35:42,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 7300 proven. 228 refuted. 0 times theorem prover too weak. 3572 trivial. 0 not checked. [2025-02-05 21:35:45,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922546005] [2025-02-05 21:35:47,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:35:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217754977] [2025-02-05 21:35:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217754977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:47,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:35:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-02-05 21:35:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974186935] [2025-02-05 21:35:47,449 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:47,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 21:35:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:47,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 21:35:47,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:35:47,452 INFO L87 Difference]: Start difference. First operand 24829 states and 39890 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 19 states have internal predecessors, (127), 5 states have call successors, (75), 5 states have call predecessors, (75), 7 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) [2025-02-05 21:36:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:36:04,203 INFO L93 Difference]: Finished difference Result 136647 states and 215166 transitions. [2025-02-05 21:36:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-02-05 21:36:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 19 states have internal predecessors, (127), 5 states have call successors, (75), 5 states have call predecessors, (75), 7 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) Word has length 481 [2025-02-05 21:36:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:36:04,587 INFO L225 Difference]: With dead ends: 136647 [2025-02-05 21:36:04,587 INFO L226 Difference]: Without dead ends: 111821 [2025-02-05 21:36:04,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3706 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2485, Invalid=9071, Unknown=0, NotChecked=0, Total=11556 [2025-02-05 21:36:04,676 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 6558 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 1594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6633 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1594 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:36:04,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6633 Valid, 3604 Invalid, 5070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1594 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 21:36:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111821 states. [2025-02-05 21:36:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111821 to 56507. [2025-02-05 21:36:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56507 states, 43908 states have (on average 1.5056937232395007) internal successors, (66112), 44372 states have internal predecessors, (66112), 11886 states have call successors, (11886), 712 states have call predecessors, (11886), 712 states have return successors, (11886), 11422 states have call predecessors, (11886), 11886 states have call successors, (11886) [2025-02-05 21:36:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56507 states to 56507 states and 89884 transitions. [2025-02-05 21:36:10,798 INFO L78 Accepts]: Start accepts. Automaton has 56507 states and 89884 transitions. Word has length 481 [2025-02-05 21:36:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:36:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 56507 states and 89884 transitions. [2025-02-05 21:36:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 19 states have internal predecessors, (127), 5 states have call successors, (75), 5 states have call predecessors, (75), 7 states have return successors, (75), 5 states have call predecessors, (75), 5 states have call successors, (75) [2025-02-05 21:36:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 56507 states and 89884 transitions. [2025-02-05 21:36:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:36:10,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:36:10,815 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:36:10,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:36:11,016 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,SelfDestructingSolverStorable12 [2025-02-05 21:36:11,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:36:11,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:36:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1588696382, now seen corresponding path program 1 times [2025-02-05 21:36:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:36:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790515213] [2025-02-05 21:36:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:36:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:36:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.