./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.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_operatoramount_amount500_file-95.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 d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:46:05,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:46:05,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:46:05,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:46:05,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:46:05,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:46:05,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:46:05,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:46:05,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:46:05,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:46:05,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:46:05,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:46:05,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:46:05,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:46:05,280 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:46:05,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:46:05,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:46:05,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:46:05,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:05,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:46:05,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:46:05,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:46:05,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:46:05,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:46:05,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:46:05,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:46:05,283 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 -> d09885049a0031727b27530c803aaab3d322c61ed8e044029287939cd57fd4df [2025-02-06 02:46:05,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:46:05,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:46:05,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:46:05,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:46:05,533 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:46:05,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-02-06 02:46:06,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30108e56/d793ca090e7446f287a926b065e5f3d6/FLAG293570c0c [2025-02-06 02:46:06,980 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:46:06,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-95.i [2025-02-06 02:46:07,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30108e56/d793ca090e7446f287a926b065e5f3d6/FLAG293570c0c [2025-02-06 02:46:07,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d30108e56/d793ca090e7446f287a926b065e5f3d6 [2025-02-06 02:46:07,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:46:07,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:46:07,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:07,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:46:07,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:46:07,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07, skipping insertion in model container [2025-02-06 02:46:07,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:46:07,163 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_operatoramount_amount500_file-95.i[916,929] [2025-02-06 02:46:07,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:07,322 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:46:07,329 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_operatoramount_amount500_file-95.i[916,929] [2025-02-06 02:46:07,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:07,467 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:46:07,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07 WrapperNode [2025-02-06 02:46:07,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:07,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:07,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:46:07,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:46:07,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,560 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 688 [2025-02-06 02:46:07,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:07,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:46:07,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:46:07,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:46:07,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,666 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-06 02:46:07,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:46:07,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:46:07,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:46:07,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:46:07,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (1/1) ... [2025-02-06 02:46:07,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:07,742 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-06 02:46:07,747 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-06 02:46:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:46:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:46:07,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:46:07,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:46:07,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:46:07,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:46:07,881 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:46:07,882 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:46:08,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1;havoc property_#t~ite57#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short61#1; [2025-02-06 02:46:08,754 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 02:46:08,754 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:46:08,783 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:46:08,783 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:46:08,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:08 BoogieIcfgContainer [2025-02-06 02:46:08,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:46:08,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:46:08,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:46:08,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:46:08,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:46:07" (1/3) ... [2025-02-06 02:46:08,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ff6dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:08, skipping insertion in model container [2025-02-06 02:46:08,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:07" (2/3) ... [2025-02-06 02:46:08,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ff6dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:08, skipping insertion in model container [2025-02-06 02:46:08,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:08" (3/3) ... [2025-02-06 02:46:08,811 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-95.i [2025-02-06 02:46:08,822 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:46:08,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-95.i that has 2 procedures, 282 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:46:08,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:46:08,894 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;@54b738fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:46:08,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:46:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:46:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-06 02:46:08,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:08,923 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:08,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 193831879, now seen corresponding path program 1 times [2025-02-06 02:46:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806600454] [2025-02-06 02:46:08,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:09,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 02:46:09,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 02:46:09,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:09,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-02-06 02:46:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806600454] [2025-02-06 02:46:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806600454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877663987] [2025-02-06 02:46:09,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:09,469 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-06 02:46:09,471 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-06 02:46:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 02:46:09,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 02:46:09,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:09,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:09,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:46:09,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-02-06 02:46:09,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:46:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877663987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:46:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:46:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388258666] [2025-02-06 02:46:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:09,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:46:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:09,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:46:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:46:09,850 INFO L87 Difference]: Start difference. First operand has 282 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:46:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:09,913 INFO L93 Difference]: Finished difference Result 558 states and 984 transitions. [2025-02-06 02:46:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:46:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 477 [2025-02-06 02:46:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:09,928 INFO L225 Difference]: With dead ends: 558 [2025-02-06 02:46:09,929 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 02:46:09,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 478 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-06 02:46:09,937 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:09,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 02:46:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-02-06 02:46:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:46:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 455 transitions. [2025-02-06 02:46:10,009 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 455 transitions. Word has length 477 [2025-02-06 02:46:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:10,011 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 455 transitions. [2025-02-06 02:46:10,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-06 02:46:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 455 transitions. [2025-02-06 02:46:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-06 02:46:10,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:10,024 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:10,033 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-06 02:46:10,229 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-06 02:46:10,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:10,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -412522672, now seen corresponding path program 1 times [2025-02-06 02:46:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128906626] [2025-02-06 02:46:10,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 02:46:10,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 02:46:10,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:10,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:10,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128906626] [2025-02-06 02:46:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128906626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:10,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:10,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448968489] [2025-02-06 02:46:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:10,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:10,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:10,739 INFO L87 Difference]: Start difference. First operand 279 states and 455 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:10,896 INFO L93 Difference]: Finished difference Result 828 states and 1353 transitions. [2025-02-06 02:46:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:10,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-02-06 02:46:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:10,904 INFO L225 Difference]: With dead ends: 828 [2025-02-06 02:46:10,905 INFO L226 Difference]: Without dead ends: 552 [2025-02-06 02:46:10,907 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-06 02:46:10,909 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 414 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:10,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1216 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-06 02:46:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 550. [2025-02-06 02:46:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 409 states have (on average 1.5134474327628362) internal successors, (619), 409 states have internal predecessors, (619), 138 states have call successors, (138), 2 states have call predecessors, (138), 2 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-02-06 02:46:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 895 transitions. [2025-02-06 02:46:10,975 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 895 transitions. Word has length 477 [2025-02-06 02:46:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:10,977 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 895 transitions. [2025-02-06 02:46:10,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 895 transitions. [2025-02-06 02:46:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-06 02:46:10,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:10,984 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:46:10,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:10,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1368043951, now seen corresponding path program 1 times [2025-02-06 02:46:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160380727] [2025-02-06 02:46:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:11,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 02:46:11,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 02:46:11,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:11,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160380727] [2025-02-06 02:46:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160380727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537228148] [2025-02-06 02:46:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:11,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:11,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:11,381 INFO L87 Difference]: Start difference. First operand 550 states and 895 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:11,510 INFO L93 Difference]: Finished difference Result 1442 states and 2345 transitions. [2025-02-06 02:46:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-02-06 02:46:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:11,516 INFO L225 Difference]: With dead ends: 1442 [2025-02-06 02:46:11,517 INFO L226 Difference]: Without dead ends: 895 [2025-02-06 02:46:11,518 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-06 02:46:11,519 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 230 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:11,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 858 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-06 02:46:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2025-02-06 02:46:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 724 states have (on average 1.5469613259668509) internal successors, (1120), 726 states have internal predecessors, (1120), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-06 02:46:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1444 transitions. [2025-02-06 02:46:11,581 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1444 transitions. Word has length 477 [2025-02-06 02:46:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:11,582 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1444 transitions. [2025-02-06 02:46:11,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1444 transitions. [2025-02-06 02:46:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-06 02:46:11,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:11,588 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:11,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:46:11,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:11,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash 880733809, now seen corresponding path program 1 times [2025-02-06 02:46:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165187433] [2025-02-06 02:46:11,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:11,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-06 02:46:11,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-06 02:46:11,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165187433] [2025-02-06 02:46:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165187433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92754265] [2025-02-06 02:46:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:12,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:12,341 INFO L87 Difference]: Start difference. First operand 891 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:12,679 INFO L93 Difference]: Finished difference Result 2487 states and 4037 transitions. [2025-02-06 02:46:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:12,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 477 [2025-02-06 02:46:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:12,697 INFO L225 Difference]: With dead ends: 2487 [2025-02-06 02:46:12,698 INFO L226 Difference]: Without dead ends: 1599 [2025-02-06 02:46:12,702 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-06 02:46:12,703 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 351 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:12,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1315 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-02-06 02:46:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1012. [2025-02-06 02:46:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 774 states have (on average 1.5129198966408268) internal successors, (1171), 776 states have internal predecessors, (1171), 231 states have call successors, (231), 6 states have call predecessors, (231), 6 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2025-02-06 02:46:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1633 transitions. [2025-02-06 02:46:12,841 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1633 transitions. Word has length 477 [2025-02-06 02:46:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1633 transitions. [2025-02-06 02:46:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1633 transitions. [2025-02-06 02:46:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:12,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:12,848 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:12,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:46:12,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1582650716, now seen corresponding path program 1 times [2025-02-06 02:46:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106591040] [2025-02-06 02:46:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:12,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:12,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:12,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:12,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:12,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106591040] [2025-02-06 02:46:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106591040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202847546] [2025-02-06 02:46:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:13,608 INFO L87 Difference]: Start difference. First operand 1012 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:13,774 INFO L93 Difference]: Finished difference Result 2776 states and 4491 transitions. [2025-02-06 02:46:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-02-06 02:46:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:13,795 INFO L225 Difference]: With dead ends: 2776 [2025-02-06 02:46:13,796 INFO L226 Difference]: Without dead ends: 1888 [2025-02-06 02:46:13,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:13,798 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 283 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:13,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 853 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-02-06 02:46:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1886. [2025-02-06 02:46:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1482 states have (on average 1.508097165991903) internal successors, (2235), 1486 states have internal predecessors, (2235), 393 states have call successors, (393), 10 states have call predecessors, (393), 10 states have return successors, (393), 389 states have call predecessors, (393), 393 states have call successors, (393) [2025-02-06 02:46:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3021 transitions. [2025-02-06 02:46:13,904 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3021 transitions. Word has length 478 [2025-02-06 02:46:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:13,905 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 3021 transitions. [2025-02-06 02:46:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3021 transitions. [2025-02-06 02:46:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:13,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:13,912 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:13,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:46:13,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 149132570, now seen corresponding path program 1 times [2025-02-06 02:46:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837333923] [2025-02-06 02:46:13,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:13,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:14,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:14,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837333923] [2025-02-06 02:46:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837333923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458349320] [2025-02-06 02:46:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:14,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:14,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:14,950 INFO L87 Difference]: Start difference. First operand 1886 states and 3021 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:15,514 INFO L93 Difference]: Finished difference Result 6090 states and 9737 transitions. [2025-02-06 02:46:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:15,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-02-06 02:46:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:15,537 INFO L225 Difference]: With dead ends: 6090 [2025-02-06 02:46:15,537 INFO L226 Difference]: Without dead ends: 4328 [2025-02-06 02:46:15,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-06 02:46:15,545 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 858 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:15,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1409 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2025-02-06 02:46:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 3518. [2025-02-06 02:46:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 2837 states have (on average 1.5178004934790272) internal successors, (4306), 2849 states have internal predecessors, (4306), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-02-06 02:46:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 5628 transitions. [2025-02-06 02:46:15,795 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 5628 transitions. Word has length 478 [2025-02-06 02:46:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 3518 states and 5628 transitions. [2025-02-06 02:46:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 5628 transitions. [2025-02-06 02:46:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:15,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:15,806 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:46:15,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash 162665371, now seen corresponding path program 1 times [2025-02-06 02:46:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582847025] [2025-02-06 02:46:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:16,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:16,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582847025] [2025-02-06 02:46:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582847025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257893868] [2025-02-06 02:46:16,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:16,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:16,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:16,785 INFO L87 Difference]: Start difference. First operand 3518 states and 5628 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:17,437 INFO L93 Difference]: Finished difference Result 9667 states and 15544 transitions. [2025-02-06 02:46:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-02-06 02:46:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:17,470 INFO L225 Difference]: With dead ends: 9667 [2025-02-06 02:46:17,470 INFO L226 Difference]: Without dead ends: 6277 [2025-02-06 02:46:17,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:17,480 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 516 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:17,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1771 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:46:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6277 states. [2025-02-06 02:46:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6277 to 3523. [2025-02-06 02:46:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3523 states, 2842 states have (on average 1.5172413793103448) internal successors, (4312), 2854 states have internal predecessors, (4312), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-02-06 02:46:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5634 transitions. [2025-02-06 02:46:17,819 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5634 transitions. Word has length 478 [2025-02-06 02:46:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:17,819 INFO L471 AbstractCegarLoop]: Abstraction has 3523 states and 5634 transitions. [2025-02-06 02:46:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5634 transitions. [2025-02-06 02:46:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:17,825 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:46:17,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1599527556, now seen corresponding path program 1 times [2025-02-06 02:46:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71398478] [2025-02-06 02:46:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:17,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:17,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:17,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71398478] [2025-02-06 02:46:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71398478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:18,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983191291] [2025-02-06 02:46:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:18,243 INFO L87 Difference]: Start difference. First operand 3523 states and 5634 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:18,714 INFO L93 Difference]: Finished difference Result 9227 states and 14794 transitions. [2025-02-06 02:46:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-02-06 02:46:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:18,740 INFO L225 Difference]: With dead ends: 9227 [2025-02-06 02:46:18,740 INFO L226 Difference]: Without dead ends: 5837 [2025-02-06 02:46:18,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:18,752 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 517 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:18,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1612 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5837 states. [2025-02-06 02:46:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5837 to 3525. [2025-02-06 02:46:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2844 states have (on average 1.5168776371308017) internal successors, (4314), 2856 states have internal predecessors, (4314), 661 states have call successors, (661), 19 states have call predecessors, (661), 19 states have return successors, (661), 649 states have call predecessors, (661), 661 states have call successors, (661) [2025-02-06 02:46:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5636 transitions. [2025-02-06 02:46:19,010 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5636 transitions. Word has length 478 [2025-02-06 02:46:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5636 transitions. [2025-02-06 02:46:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5636 transitions. [2025-02-06 02:46:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:19,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:19,017 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:46:19,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1210384189, now seen corresponding path program 1 times [2025-02-06 02:46:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866908486] [2025-02-06 02:46:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:19,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:20,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:20,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 78 proven. 126 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-02-06 02:46:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866908486] [2025-02-06 02:46:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866908486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284182837] [2025-02-06 02:46:20,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:20,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:20,522 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-06 02:46:20,523 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-06 02:46:20,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:20,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:20,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:20,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:20,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 02:46:20,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:20,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:46:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284182837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:20,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:46:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 02:46:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343368929] [2025-02-06 02:46:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:20,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:20,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:46:20,946 INFO L87 Difference]: Start difference. First operand 3525 states and 5636 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:21,223 INFO L93 Difference]: Finished difference Result 8193 states and 13122 transitions. [2025-02-06 02:46:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 478 [2025-02-06 02:46:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:21,256 INFO L225 Difference]: With dead ends: 8193 [2025-02-06 02:46:21,257 INFO L226 Difference]: Without dead ends: 4803 [2025-02-06 02:46:21,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:46:21,265 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 479 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:21,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1929 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2025-02-06 02:46:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4425. [2025-02-06 02:46:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 3546 states have (on average 1.5076142131979695) internal successors, (5346), 3562 states have internal predecessors, (5346), 851 states have call successors, (851), 27 states have call predecessors, (851), 27 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-02-06 02:46:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 7048 transitions. [2025-02-06 02:46:21,490 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 7048 transitions. Word has length 478 [2025-02-06 02:46:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:21,491 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 7048 transitions. [2025-02-06 02:46:21,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 7048 transitions. [2025-02-06 02:46:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-06 02:46:21,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:21,498 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:21,507 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-06 02:46:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:21,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1561184126, now seen corresponding path program 1 times [2025-02-06 02:46:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994329615] [2025-02-06 02:46:21,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:21,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:22,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:22,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 78 proven. 126 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-02-06 02:46:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994329615] [2025-02-06 02:46:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994329615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955798832] [2025-02-06 02:46:22,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:22,717 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-06 02:46:22,719 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-06 02:46:22,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-06 02:46:22,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 02:46:22,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:23,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:46:23,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4604 proven. 120 refuted. 0 times theorem prover too weak. 4660 trivial. 0 not checked. [2025-02-06 02:46:23,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 84 proven. 120 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-02-06 02:46:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955798832] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:46:23,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:46:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-06 02:46:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657680042] [2025-02-06 02:46:23,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 02:46:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:23,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 02:46:23,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:46:23,684 INFO L87 Difference]: Start difference. First operand 4425 states and 7048 transitions. Second operand has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) [2025-02-06 02:46:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:24,784 INFO L93 Difference]: Finished difference Result 8945 states and 14079 transitions. [2025-02-06 02:46:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:46:24,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) Word has length 478 [2025-02-06 02:46:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:24,807 INFO L225 Difference]: With dead ends: 8945 [2025-02-06 02:46:24,807 INFO L226 Difference]: Without dead ends: 4655 [2025-02-06 02:46:24,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:46:24,817 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1606 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:24,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 868 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:46:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-02-06 02:46:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4601. [2025-02-06 02:46:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 3678 states have (on average 1.478520935290919) internal successors, (5438), 3694 states have internal predecessors, (5438), 851 states have call successors, (851), 71 states have call predecessors, (851), 71 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-02-06 02:46:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7140 transitions. [2025-02-06 02:46:25,150 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7140 transitions. Word has length 478 [2025-02-06 02:46:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:25,151 INFO L471 AbstractCegarLoop]: Abstraction has 4601 states and 7140 transitions. [2025-02-06 02:46:25,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.076923076923077) internal successors, (287), 13 states have internal predecessors, (287), 6 states have call successors, (170), 2 states have call predecessors, (170), 4 states have return successors, (171), 6 states have call predecessors, (171), 6 states have call successors, (171) [2025-02-06 02:46:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7140 transitions. [2025-02-06 02:46:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-06 02:46:25,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:25,157 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:25,166 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-06 02:46:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:25,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:25,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1679281289, now seen corresponding path program 1 times [2025-02-06 02:46:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354051105] [2025-02-06 02:46:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-06 02:46:26,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-06 02:46:26,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 174 proven. 30 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-02-06 02:46:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354051105] [2025-02-06 02:46:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354051105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697602252] [2025-02-06 02:46:26,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:26,491 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-06 02:46:26,492 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-06 02:46:26,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-06 02:46:26,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-06 02:46:26,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:26,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:46:26,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 2504 proven. 30 refuted. 0 times theorem prover too weak. 6850 trivial. 0 not checked. [2025-02-06 02:46:26,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 174 proven. 30 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-02-06 02:46:27,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697602252] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:46:27,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:46:27,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:46:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660102107] [2025-02-06 02:46:27,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:46:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:27,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:46:27,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:27,169 INFO L87 Difference]: Start difference. First operand 4601 states and 7140 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:46:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:27,794 INFO L93 Difference]: Finished difference Result 9159 states and 14164 transitions. [2025-02-06 02:46:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:46:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 480 [2025-02-06 02:46:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:27,817 INFO L225 Difference]: With dead ends: 9159 [2025-02-06 02:46:27,817 INFO L226 Difference]: Without dead ends: 4709 [2025-02-06 02:46:27,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 957 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:46:27,834 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 930 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:27,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 954 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:46:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2025-02-06 02:46:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4637. [2025-02-06 02:46:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 3705 states have (on average 1.4642375168690958) internal successors, (5425), 3721 states have internal predecessors, (5425), 851 states have call successors, (851), 80 states have call predecessors, (851), 80 states have return successors, (851), 835 states have call predecessors, (851), 851 states have call successors, (851) [2025-02-06 02:46:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 7127 transitions. [2025-02-06 02:46:28,113 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 7127 transitions. Word has length 480 [2025-02-06 02:46:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:28,113 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 7127 transitions. [2025-02-06 02:46:28,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-06 02:46:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 7127 transitions. [2025-02-06 02:46:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-06 02:46:28,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:28,120 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:28,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:46:28,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 02:46:28,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash -816153035, now seen corresponding path program 1 times [2025-02-06 02:46:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:28,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969472560] [2025-02-06 02:46:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:28,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-06 02:46:28,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-06 02:46:28,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:28,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-06 02:46:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:28,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969472560] [2025-02-06 02:46:28,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969472560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:28,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:28,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:28,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657990833] [2025-02-06 02:46:28,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:28,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:28,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:28,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:28,915 INFO L87 Difference]: Start difference. First operand 4637 states and 7127 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:29,355 INFO L93 Difference]: Finished difference Result 9289 states and 14245 transitions. [2025-02-06 02:46:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:29,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 480 [2025-02-06 02:46:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:29,373 INFO L225 Difference]: With dead ends: 9289 [2025-02-06 02:46:29,374 INFO L226 Difference]: Without dead ends: 4807 [2025-02-06 02:46:29,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 02:46:29,384 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 673 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:29,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 964 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:46:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2025-02-06 02:46:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4569. [2025-02-06 02:46:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4569 states, 3684 states have (on average 1.4614549402823018) internal successors, (5384), 3700 states have internal predecessors, (5384), 803 states have call successors, (803), 81 states have call predecessors, (803), 81 states have return successors, (803), 787 states have call predecessors, (803), 803 states have call successors, (803) [2025-02-06 02:46:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 6990 transitions. [2025-02-06 02:46:29,618 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 6990 transitions. Word has length 480 [2025-02-06 02:46:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 4569 states and 6990 transitions. [2025-02-06 02:46:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-06 02:46:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 6990 transitions. [2025-02-06 02:46:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-06 02:46:29,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:29,625 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:46:29,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:46:29,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -228595080, now seen corresponding path program 1 times [2025-02-06 02:46:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409996642] [2025-02-06 02:46:29,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:29,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-06 02:46:30,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-06 02:46:30,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:30,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat