./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.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-82.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 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:40:25,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:40:25,355 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:40:25,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:40:25,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:40:25,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:40:25,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:40:25,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:40:25,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:40:25,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:40:25,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:40:25,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:40:25,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:40:25,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:40:25,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:40:25,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:40:25,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:25,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:40:25,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:40:25,382 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 -> 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 [2025-02-05 21:40:25,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:40:25,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:40:25,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:40:25,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:40:25,628 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:40:25,629 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-82.i [2025-02-05 21:40:26,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79a6d3281/653a867892f64d2285dae85991f0296c/FLAG3e53d795a [2025-02-05 21:40:27,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:40:27,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-02-05 21:40:27,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79a6d3281/653a867892f64d2285dae85991f0296c/FLAG3e53d795a [2025-02-05 21:40:27,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79a6d3281/653a867892f64d2285dae85991f0296c [2025-02-05 21:40:27,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:40:27,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:40:27,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:27,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:40:27,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:40:27,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42173353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27, skipping insertion in model container [2025-02-05 21:40:27,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:40:27,486 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-82.i[916,929] [2025-02-05 21:40:27,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:27,596 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:40:27,603 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-82.i[916,929] [2025-02-05 21:40:27,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:27,675 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:40:27,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27 WrapperNode [2025-02-05 21:40:27,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:27,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:27,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:40:27,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:40:27,681 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:40:27" (1/1) ... [2025-02-05 21:40:27,691 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:40:27" (1/1) ... [2025-02-05 21:40:27,735 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 573 [2025-02-05 21:40:27,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:27,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:40:27,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:40:27,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:40:27,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,774 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:40:27,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:40:27,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:40:27,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:40:27,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:40:27,805 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (1/1) ... [2025-02-05 21:40:27,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:27,831 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:40:27,833 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:40:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:40:27,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:40:27,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:40:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:40:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:40:27,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:40:27,948 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:40:27,950 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:40:28,590 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-05 21:40:28,591 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:40:28,610 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:40:28,611 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:40:28,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:28 BoogieIcfgContainer [2025-02-05 21:40:28,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:40:28,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:40:28,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:40:28,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:40:28,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:40:27" (1/3) ... [2025-02-05 21:40:28,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c5d7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:28, skipping insertion in model container [2025-02-05 21:40:28,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:27" (2/3) ... [2025-02-05 21:40:28,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c5d7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:28, skipping insertion in model container [2025-02-05 21:40:28,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:28" (3/3) ... [2025-02-05 21:40:28,618 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-02-05 21:40:28,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:40:28,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:40:28,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:40:28,684 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;@6917f0d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:40:28,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:40:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 21:40:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 21:40:28,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:28,704 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:28,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:28,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1148155562, now seen corresponding path program 1 times [2025-02-05 21:40:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586674835] [2025-02-05 21:40:28,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:28,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:28,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 21:40:28,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 21:40:28,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 21:40:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586674835] [2025-02-05 21:40:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586674835] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16248797] [2025-02-05 21:40:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:29,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:29,207 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:40:29,209 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:40:29,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 21:40:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 21:40:29,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:29,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:29,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:40:29,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 21:40:29,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16248797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:29,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:40:29,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:40:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048526803] [2025-02-05 21:40:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:29,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:40:29,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:29,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:40:29,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:40:29,557 INFO L87 Difference]: Start difference. First operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 21:40:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:29,609 INFO L93 Difference]: Finished difference Result 463 states and 853 transitions. [2025-02-05 21:40:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:40:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 502 [2025-02-05 21:40:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:29,620 INFO L225 Difference]: With dead ends: 463 [2025-02-05 21:40:29,621 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 21:40:29,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 503 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:40:29,629 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:29,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 21:40:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-05 21:40:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 21:40:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 382 transitions. [2025-02-05 21:40:29,682 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 382 transitions. Word has length 502 [2025-02-05 21:40:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:29,683 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 382 transitions. [2025-02-05 21:40:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 21:40:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 382 transitions. [2025-02-05 21:40:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 21:40:29,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:29,695 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:29,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:40:29,896 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:40:29,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1371311108, now seen corresponding path program 1 times [2025-02-05 21:40:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514739663] [2025-02-05 21:40:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:29,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 21:40:30,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 21:40:30,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:30,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:40:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514739663] [2025-02-05 21:40:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514739663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721467002] [2025-02-05 21:40:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:30,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:30,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:30,266 INFO L87 Difference]: Start difference. First operand 231 states and 382 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:30,387 INFO L93 Difference]: Finished difference Result 594 states and 985 transitions. [2025-02-05 21:40:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:30,388 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 502 [2025-02-05 21:40:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:30,393 INFO L225 Difference]: With dead ends: 594 [2025-02-05 21:40:30,393 INFO L226 Difference]: Without dead ends: 366 [2025-02-05 21:40:30,394 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:40:30,395 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 222 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:30,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 706 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:40:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-05 21:40:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2025-02-05 21:40:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 250 states have internal predecessors, (376), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-05 21:40:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 598 transitions. [2025-02-05 21:40:30,444 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 598 transitions. Word has length 502 [2025-02-05 21:40:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:30,445 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 598 transitions. [2025-02-05 21:40:30,445 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 598 transitions. [2025-02-05 21:40:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 21:40:30,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:30,453 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:40:30,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:30,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 887023189, now seen corresponding path program 1 times [2025-02-05 21:40:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715381710] [2025-02-05 21:40:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:40:30,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:40:30,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:30,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:40:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715381710] [2025-02-05 21:40:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715381710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:40:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145069444] [2025-02-05 21:40:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:31,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:40:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:31,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:40:31,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:40:31,279 INFO L87 Difference]: Start difference. First operand 363 states and 598 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:31,544 INFO L93 Difference]: Finished difference Result 981 states and 1618 transitions. [2025-02-05 21:40:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:40:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-02-05 21:40:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:31,552 INFO L225 Difference]: With dead ends: 981 [2025-02-05 21:40:31,553 INFO L226 Difference]: Without dead ends: 621 [2025-02-05 21:40:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:40:31,555 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 209 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 989 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:40:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-05 21:40:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 611. [2025-02-05 21:40:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 437 states have (on average 1.528604118993135) internal successors, (668), 440 states have internal predecessors, (668), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-02-05 21:40:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1006 transitions. [2025-02-05 21:40:31,624 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1006 transitions. Word has length 503 [2025-02-05 21:40:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1006 transitions. [2025-02-05 21:40:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1006 transitions. [2025-02-05 21:40:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 21:40:31,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:31,640 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:40:31,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1020411692, now seen corresponding path program 1 times [2025-02-05 21:40:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429247312] [2025-02-05 21:40:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:31,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 21:40:31,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 21:40:31,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:31,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:40:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429247312] [2025-02-05 21:40:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429247312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:40:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340637672] [2025-02-05 21:40:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:40:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:33,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:40:33,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:40:33,522 INFO L87 Difference]: Start difference. First operand 611 states and 1006 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:34,733 INFO L93 Difference]: Finished difference Result 1531 states and 2500 transitions. [2025-02-05 21:40:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:40:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 504 [2025-02-05 21:40:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:34,740 INFO L225 Difference]: With dead ends: 1531 [2025-02-05 21:40:34,741 INFO L226 Difference]: Without dead ends: 923 [2025-02-05 21:40:34,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:40:34,743 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 995 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:34,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1910 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:40:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-05 21:40:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-02-05 21:40:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 461 states have (on average 1.5336225596529285) internal successors, (707), 464 states have internal predecessors, (707), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-02-05 21:40:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1045 transitions. [2025-02-05 21:40:34,803 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1045 transitions. Word has length 504 [2025-02-05 21:40:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:34,805 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 1045 transitions. [2025-02-05 21:40:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1045 transitions. [2025-02-05 21:40:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 21:40:34,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:34,814 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:40:34,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2029791123, now seen corresponding path program 1 times [2025-02-05 21:40:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421140519] [2025-02-05 21:40:34,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:34,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 21:40:35,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 21:40:35,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:35,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 177 proven. 60 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-05 21:40:35,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421140519] [2025-02-05 21:40:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421140519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451165457] [2025-02-05 21:40:35,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:35,442 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:40:35,444 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:40:35,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 21:40:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 21:40:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:35,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:35,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:40:35,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 849 proven. 6 refuted. 0 times theorem prover too weak. 11785 trivial. 0 not checked. [2025-02-05 21:40:35,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 231 proven. 6 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-05 21:40:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451165457] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:36,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:36,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:40:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055860932] [2025-02-05 21:40:36,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:40:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:36,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:40:36,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:40:36,168 INFO L87 Difference]: Start difference. First operand 635 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-02-05 21:40:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:36,877 INFO L93 Difference]: Finished difference Result 1282 states and 2100 transitions. [2025-02-05 21:40:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:40:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 504 [2025-02-05 21:40:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:36,883 INFO L225 Difference]: With dead ends: 1282 [2025-02-05 21:40:36,884 INFO L226 Difference]: Without dead ends: 650 [2025-02-05 21:40:36,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:40:36,889 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 723 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:36,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 679 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:40:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-05 21:40:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2025-02-05 21:40:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 464 states have (on average 1.5107758620689655) internal successors, (701), 467 states have internal predecessors, (701), 169 states have call successors, (169), 6 states have call predecessors, (169), 6 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-02-05 21:40:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1039 transitions. [2025-02-05 21:40:36,963 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1039 transitions. Word has length 504 [2025-02-05 21:40:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:36,964 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1039 transitions. [2025-02-05 21:40:36,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-02-05 21:40:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1039 transitions. [2025-02-05 21:40:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-05 21:40:36,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:36,968 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,976 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:40:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:37,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash 759588658, now seen corresponding path program 1 times [2025-02-05 21:40:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780583838] [2025-02-05 21:40:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:37,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 21:40:37,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 21:40:37,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:37,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:40:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780583838] [2025-02-05 21:40:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780583838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:40:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540830958] [2025-02-05 21:40:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:37,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:40:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:37,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:40:37,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:40:37,600 INFO L87 Difference]: Start difference. First operand 640 states and 1039 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:37,876 INFO L93 Difference]: Finished difference Result 1281 states and 2079 transitions. [2025-02-05 21:40:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:40:37,877 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 505 [2025-02-05 21:40:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:37,882 INFO L225 Difference]: With dead ends: 1281 [2025-02-05 21:40:37,882 INFO L226 Difference]: Without dead ends: 644 [2025-02-05 21:40:37,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:40:37,887 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 592 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:37,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 367 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:40:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-05 21:40:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 640. [2025-02-05 21:40:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 464 states have (on average 1.5021551724137931) internal successors, (697), 467 states have internal predecessors, (697), 169 states have call successors, (169), 6 states have call predecessors, (169), 6 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-02-05 21:40:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1035 transitions. [2025-02-05 21:40:37,937 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1035 transitions. Word has length 505 [2025-02-05 21:40:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:37,938 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1035 transitions. [2025-02-05 21:40:37,938 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, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:40:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1035 transitions. [2025-02-05 21:40:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-05 21:40:37,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:37,941 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:40:37,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:37,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2027826829, now seen corresponding path program 1 times [2025-02-05 21:40:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:37,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888301486] [2025-02-05 21:40:37,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:37,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 21:40:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 21:40:38,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:38,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-05 21:40:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:38,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888301486] [2025-02-05 21:40:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888301486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953406799] [2025-02-05 21:40:38,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:38,388 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:40:38,389 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:40:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 21:40:38,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 21:40:38,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:38,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:40:38,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5937 proven. 150 refuted. 0 times theorem prover too weak. 6553 trivial. 0 not checked. [2025-02-05 21:40:39,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-05 21:40:39,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953406799] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:39,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:39,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-05 21:40:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359921794] [2025-02-05 21:40:39,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:39,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:40:39,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:39,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:40:39,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:40:39,624 INFO L87 Difference]: Start difference. First operand 640 states and 1035 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-02-05 21:40:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:40,013 INFO L93 Difference]: Finished difference Result 1041 states and 1661 transitions. [2025-02-05 21:40:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:40:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) Word has length 505 [2025-02-05 21:40:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:40,017 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 21:40:40,017 INFO L226 Difference]: Without dead ends: 404 [2025-02-05 21:40:40,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:40:40,020 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 174 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:40,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 626 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:40:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-05 21:40:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2025-02-05 21:40:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 276 states have (on average 1.4202898550724639) internal successors, (392), 277 states have internal predecessors, (392), 111 states have call successors, (111), 8 states have call predecessors, (111), 8 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-05 21:40:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 614 transitions. [2025-02-05 21:40:40,062 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 614 transitions. Word has length 505 [2025-02-05 21:40:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:40,063 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 614 transitions. [2025-02-05 21:40:40,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-02-05 21:40:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 614 transitions. [2025-02-05 21:40:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-05 21:40:40,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:40,068 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:40,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:40:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:40,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:40,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1723994970, now seen corresponding path program 1 times [2025-02-05 21:40:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:40,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045874575] [2025-02-05 21:40:40,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 21:40:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 21:40:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 153 proven. 84 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-02-05 21:40:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045874575] [2025-02-05 21:40:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045874575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083483187] [2025-02-05 21:40:43,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:43,303 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:40:43,305 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:40:43,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 21:40:43,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 21:40:43,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:43,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:43,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-05 21:40:43,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 9077 proven. 873 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2025-02-05 21:40:50,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:40:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 651 proven. 504 refuted. 0 times theorem prover too weak. 11485 trivial. 0 not checked. [2025-02-05 21:40:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083483187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:40:52,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:40:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 23] total 59 [2025-02-05 21:40:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085416499] [2025-02-05 21:40:52,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:40:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-05 21:40:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-05 21:40:52,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2823, Unknown=0, NotChecked=0, Total=3422 [2025-02-05 21:40:52,973 INFO L87 Difference]: Start difference. First operand 396 states and 614 transitions. Second operand has 59 states, 56 states have (on average 5.089285714285714) internal successors, (285), 54 states have internal predecessors, (285), 18 states have call successors, (180), 8 states have call predecessors, (180), 17 states have return successors, (183), 18 states have call predecessors, (183), 18 states have call successors, (183)