./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.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-22.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 a2f8cfcbb935c56cacc0dcdd0cb17c9fa32a1e539a6b0588fb3d51d3444efdea --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:38:14,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:38:14,867 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:38:14,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:38:14,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:38:14,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:38:14,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:38:14,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:38:14,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:38:14,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:38:14,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:38:14,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:38:14,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:38:14,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:38:14,903 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:38:14,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:38:14,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:38:14,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:38:14,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:38:14,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:38:14,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:38:14,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:14,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:38:14,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:38:14,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:38:14,906 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 -> a2f8cfcbb935c56cacc0dcdd0cb17c9fa32a1e539a6b0588fb3d51d3444efdea [2025-02-06 02:38:15,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:38:15,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:38:15,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:38:15,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:38:15,186 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:38:15,187 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-22.i [2025-02-06 02:38:16,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfe72e42/f5d7a749d22c45fd9ae2122196be8c67/FLAG9a5ee96c2 [2025-02-06 02:38:16,808 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:38:16,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i [2025-02-06 02:38:16,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfe72e42/f5d7a749d22c45fd9ae2122196be8c67/FLAG9a5ee96c2 [2025-02-06 02:38:16,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbfe72e42/f5d7a749d22c45fd9ae2122196be8c67 [2025-02-06 02:38:16,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:38:16,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:38:16,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:16,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:38:16,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:38:16,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:16" (1/1) ... [2025-02-06 02:38:16,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:16, skipping insertion in model container [2025-02-06 02:38:16,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:16" (1/1) ... [2025-02-06 02:38:16,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:38:17,027 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-22.i[916,929] [2025-02-06 02:38:17,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:17,251 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:38:17,266 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-22.i[916,929] [2025-02-06 02:38:17,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:38:17,409 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:38:17,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17 WrapperNode [2025-02-06 02:38:17,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:38:17,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:17,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:38:17,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:38:17,420 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:38:17" (1/1) ... [2025-02-06 02:38:17,443 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:38:17" (1/1) ... [2025-02-06 02:38:17,541 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 716 [2025-02-06 02:38:17,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:38:17,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:38:17,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:38:17,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:38:17,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,628 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:38:17,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:38:17,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:38:17,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:38:17,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:38:17,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (1/1) ... [2025-02-06 02:38:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:38:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:17,730 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:38:17,736 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:38:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:38:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:38:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:38:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:38:17,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:38:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:38:17,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:38:17,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:38:19,110 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc property_#t~bitwise43#1;havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~ite46#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short49#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~ite58#1;havoc property_#t~bitwise55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-02-06 02:38:19,290 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-02-06 02:38:19,290 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:38:19,328 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:38:19,331 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:38:19,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:19 BoogieIcfgContainer [2025-02-06 02:38:19,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:38:19,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:38:19,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:38:19,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:38:19,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:16" (1/3) ... [2025-02-06 02:38:19,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6548fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:19, skipping insertion in model container [2025-02-06 02:38:19,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:17" (2/3) ... [2025-02-06 02:38:19,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6548fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:19, skipping insertion in model container [2025-02-06 02:38:19,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:19" (3/3) ... [2025-02-06 02:38:19,342 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-22.i [2025-02-06 02:38:19,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:38:19,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-22.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:38:19,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:38:19,431 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;@372b7020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:38:19,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:38:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 228 states have internal predecessors, (353), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 02:38:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 02:38:19,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:19,464 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 873774392, now seen corresponding path program 1 times [2025-02-06 02:38:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279158688] [2025-02-06 02:38:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:19,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:19,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:19,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:19,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-02-06 02:38:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:20,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279158688] [2025-02-06 02:38:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279158688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411366156] [2025-02-06 02:38:20,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:20,162 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:38:20,165 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:38:20,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:20,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:20,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:20,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:20,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:38:20,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-02-06 02:38:20,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411366156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:38:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:38:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278051676] [2025-02-06 02:38:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:38:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:20,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:38:20,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:38:20,610 INFO L87 Difference]: Start difference. First operand has 284 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 228 states have internal predecessors, (353), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-06 02:38:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:20,723 INFO L93 Difference]: Finished difference Result 562 states and 971 transitions. [2025-02-06 02:38:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:38:20,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 401 [2025-02-06 02:38:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:20,736 INFO L225 Difference]: With dead ends: 562 [2025-02-06 02:38:20,737 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 02:38:20,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 402 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:38:20,747 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:20,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:38:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 02:38:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-06 02:38:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 225 states have (on average 1.5466666666666666) internal successors, (348), 225 states have internal predecessors, (348), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 02:38:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 456 transitions. [2025-02-06 02:38:20,836 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 456 transitions. Word has length 401 [2025-02-06 02:38:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 456 transitions. [2025-02-06 02:38:20,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-06 02:38:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 456 transitions. [2025-02-06 02:38:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 02:38:20,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:20,850 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:20,862 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:38:21,051 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:38:21,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1120924850, now seen corresponding path program 1 times [2025-02-06 02:38:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927143376] [2025-02-06 02:38:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:21,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:21,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927143376] [2025-02-06 02:38:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927143376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115737191] [2025-02-06 02:38:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:21,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:21,693 INFO L87 Difference]: Start difference. First operand 281 states and 456 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:21,895 INFO L93 Difference]: Finished difference Result 809 states and 1317 transitions. [2025-02-06 02:38:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:21,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-02-06 02:38:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:21,903 INFO L225 Difference]: With dead ends: 809 [2025-02-06 02:38:21,903 INFO L226 Difference]: Without dead ends: 531 [2025-02-06 02:38:21,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:38:21,910 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 415 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:21,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 829 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-06 02:38:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2025-02-06 02:38:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 417 states have (on average 1.5323741007194245) internal successors, (639), 417 states have internal predecessors, (639), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 02:38:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 855 transitions. [2025-02-06 02:38:22,000 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 855 transitions. Word has length 401 [2025-02-06 02:38:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:22,004 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 855 transitions. [2025-02-06 02:38:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 855 transitions. [2025-02-06 02:38:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 02:38:22,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:22,013 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:38:22,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1196976496, now seen corresponding path program 1 times [2025-02-06 02:38:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873432664] [2025-02-06 02:38:22,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:22,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873432664] [2025-02-06 02:38:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873432664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339559663] [2025-02-06 02:38:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:22,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:22,509 INFO L87 Difference]: Start difference. First operand 528 states and 855 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:22,690 INFO L93 Difference]: Finished difference Result 1447 states and 2343 transitions. [2025-02-06 02:38:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:22,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-02-06 02:38:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:22,703 INFO L225 Difference]: With dead ends: 1447 [2025-02-06 02:38:22,704 INFO L226 Difference]: Without dead ends: 922 [2025-02-06 02:38:22,706 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:38:22,707 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 330 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:22,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 857 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-02-06 02:38:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 918. [2025-02-06 02:38:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 765 states have (on average 1.5477124183006536) internal successors, (1184), 767 states have internal predecessors, (1184), 148 states have call successors, (148), 4 states have call predecessors, (148), 4 states have return successors, (148), 146 states have call predecessors, (148), 148 states have call successors, (148) [2025-02-06 02:38:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1480 transitions. [2025-02-06 02:38:22,825 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1480 transitions. Word has length 401 [2025-02-06 02:38:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:22,826 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1480 transitions. [2025-02-06 02:38:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1480 transitions. [2025-02-06 02:38:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 02:38:22,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:22,838 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:38:22,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:22,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -259493709, now seen corresponding path program 1 times [2025-02-06 02:38:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:22,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943710490] [2025-02-06 02:38:22,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:22,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943710490] [2025-02-06 02:38:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943710490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:38:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815272335] [2025-02-06 02:38:23,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:38:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:23,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:38:23,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:38:23,165 INFO L87 Difference]: Start difference. First operand 918 states and 1480 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:23,325 INFO L93 Difference]: Finished difference Result 2589 states and 4178 transitions. [2025-02-06 02:38:23,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:38:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-02-06 02:38:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:23,342 INFO L225 Difference]: With dead ends: 2589 [2025-02-06 02:38:23,343 INFO L226 Difference]: Without dead ends: 1674 [2025-02-06 02:38:23,348 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:38:23,349 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 341 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:23,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1067 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-02-06 02:38:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1670. [2025-02-06 02:38:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1403 states have (on average 1.549536707056308) internal successors, (2174), 1409 states have internal predecessors, (2174), 258 states have call successors, (258), 8 states have call predecessors, (258), 8 states have return successors, (258), 252 states have call predecessors, (258), 258 states have call successors, (258) [2025-02-06 02:38:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2690 transitions. [2025-02-06 02:38:23,515 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2690 transitions. Word has length 401 [2025-02-06 02:38:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:23,516 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2690 transitions. [2025-02-06 02:38:23,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2690 transitions. [2025-02-06 02:38:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-06 02:38:23,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:23,524 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:38:23,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:23,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -722831661, now seen corresponding path program 1 times [2025-02-06 02:38:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101415974] [2025-02-06 02:38:23,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:23,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-06 02:38:23,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-06 02:38:23,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101415974] [2025-02-06 02:38:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101415974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989094411] [2025-02-06 02:38:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:24,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:24,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:24,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:24,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:24,221 INFO L87 Difference]: Start difference. First operand 1670 states and 2690 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:24,635 INFO L93 Difference]: Finished difference Result 4649 states and 7504 transitions. [2025-02-06 02:38:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-02-06 02:38:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:24,653 INFO L225 Difference]: With dead ends: 4649 [2025-02-06 02:38:24,653 INFO L226 Difference]: Without dead ends: 2982 [2025-02-06 02:38:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:24,660 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 555 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:24,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1291 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-02-06 02:38:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2628. [2025-02-06 02:38:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2304 states have (on average 1.5967881944444444) internal successors, (3679), 2310 states have internal predecessors, (3679), 312 states have call successors, (312), 11 states have call predecessors, (312), 11 states have return successors, (312), 306 states have call predecessors, (312), 312 states have call successors, (312) [2025-02-06 02:38:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 4303 transitions. [2025-02-06 02:38:24,788 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 4303 transitions. Word has length 401 [2025-02-06 02:38:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:24,788 INFO L471 AbstractCegarLoop]: Abstraction has 2628 states and 4303 transitions. [2025-02-06 02:38:24,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 4303 transitions. [2025-02-06 02:38:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-06 02:38:24,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:24,797 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:38:24,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:24,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 400205829, now seen corresponding path program 1 times [2025-02-06 02:38:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175667586] [2025-02-06 02:38:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:24,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-06 02:38:24,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-06 02:38:24,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:24,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175667586] [2025-02-06 02:38:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175667586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:25,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:25,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:38:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671385642] [2025-02-06 02:38:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:25,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:38:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:25,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:38:25,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:38:25,402 INFO L87 Difference]: Start difference. First operand 2628 states and 4303 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:25,956 INFO L93 Difference]: Finished difference Result 5501 states and 8948 transitions. [2025-02-06 02:38:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:38:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 403 [2025-02-06 02:38:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:25,975 INFO L225 Difference]: With dead ends: 5501 [2025-02-06 02:38:25,975 INFO L226 Difference]: Without dead ends: 2983 [2025-02-06 02:38:25,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:25,983 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 561 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:25,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2040 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-02-06 02:38:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2629. [2025-02-06 02:38:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2305 states have (on average 1.596529284164859) internal successors, (3680), 2311 states have internal predecessors, (3680), 312 states have call successors, (312), 11 states have call predecessors, (312), 11 states have return successors, (312), 306 states have call predecessors, (312), 312 states have call successors, (312) [2025-02-06 02:38:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4304 transitions. [2025-02-06 02:38:26,168 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4304 transitions. Word has length 403 [2025-02-06 02:38:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:26,169 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 4304 transitions. [2025-02-06 02:38:26,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4304 transitions. [2025-02-06 02:38:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-06 02:38:26,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:26,177 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:38:26,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:26,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash -570085178, now seen corresponding path program 1 times [2025-02-06 02:38:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909130647] [2025-02-06 02:38:26,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-06 02:38:26,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-06 02:38:26,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:26,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909130647] [2025-02-06 02:38:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909130647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326109030] [2025-02-06 02:38:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:26,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:26,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:26,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:26,883 INFO L87 Difference]: Start difference. First operand 2629 states and 4304 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:27,401 INFO L93 Difference]: Finished difference Result 8872 states and 14547 transitions. [2025-02-06 02:38:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:27,402 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 403 [2025-02-06 02:38:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:27,435 INFO L225 Difference]: With dead ends: 8872 [2025-02-06 02:38:27,436 INFO L226 Difference]: Without dead ends: 6353 [2025-02-06 02:38:27,444 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:38:27,445 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 648 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:27,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1555 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2025-02-06 02:38:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6005. [2025-02-06 02:38:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6005 states, 5415 states have (on average 1.6145891043397969) internal successors, (8743), 5427 states have internal predecessors, (8743), 570 states have call successors, (570), 19 states have call predecessors, (570), 19 states have return successors, (570), 558 states have call predecessors, (570), 570 states have call successors, (570) [2025-02-06 02:38:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 9883 transitions. [2025-02-06 02:38:27,784 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 9883 transitions. Word has length 403 [2025-02-06 02:38:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:27,786 INFO L471 AbstractCegarLoop]: Abstraction has 6005 states and 9883 transitions. [2025-02-06 02:38:27,786 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 9883 transitions. [2025-02-06 02:38:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 02:38:27,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:27,794 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:38:27,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1011847042, now seen corresponding path program 1 times [2025-02-06 02:38:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:27,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413566105] [2025-02-06 02:38:27,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:27,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:27,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:27,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:27,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413566105] [2025-02-06 02:38:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413566105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:28,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:38:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816797111] [2025-02-06 02:38:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:28,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:38:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:28,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:38:28,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:38:28,415 INFO L87 Difference]: Start difference. First operand 6005 states and 9883 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:28,969 INFO L93 Difference]: Finished difference Result 8034 states and 13075 transitions. [2025-02-06 02:38:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:38:28,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-02-06 02:38:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:29,007 INFO L225 Difference]: With dead ends: 8034 [2025-02-06 02:38:29,007 INFO L226 Difference]: Without dead ends: 5508 [2025-02-06 02:38:29,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:29,016 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 546 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:29,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2045 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2025-02-06 02:38:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 5154. [2025-02-06 02:38:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 4564 states have (on average 1.5975021910604732) internal successors, (7291), 4576 states have internal predecessors, (7291), 570 states have call successors, (570), 19 states have call predecessors, (570), 19 states have return successors, (570), 558 states have call predecessors, (570), 570 states have call successors, (570) [2025-02-06 02:38:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 8431 transitions. [2025-02-06 02:38:29,376 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 8431 transitions. Word has length 405 [2025-02-06 02:38:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 8431 transitions. [2025-02-06 02:38:29,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 8431 transitions. [2025-02-06 02:38:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 02:38:29,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:29,384 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:29,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:38:29,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1026097187, now seen corresponding path program 1 times [2025-02-06 02:38:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366978940] [2025-02-06 02:38:29,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:29,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:29,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:29,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:30,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366978940] [2025-02-06 02:38:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366978940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:30,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104798323] [2025-02-06 02:38:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:30,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:30,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:30,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:30,320 INFO L87 Difference]: Start difference. First operand 5154 states and 8431 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:30,889 INFO L93 Difference]: Finished difference Result 14732 states and 24149 transitions. [2025-02-06 02:38:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:30,890 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-02-06 02:38:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:30,949 INFO L225 Difference]: With dead ends: 14732 [2025-02-06 02:38:30,949 INFO L226 Difference]: Without dead ends: 9999 [2025-02-06 02:38:30,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:38:30,968 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 317 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:30,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1184 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2025-02-06 02:38:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 9997. [2025-02-06 02:38:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 8875 states have (on average 1.5971830985915494) internal successors, (14175), 8899 states have internal predecessors, (14175), 1086 states have call successors, (1086), 35 states have call predecessors, (1086), 35 states have return successors, (1086), 1062 states have call predecessors, (1086), 1086 states have call successors, (1086) [2025-02-06 02:38:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 16347 transitions. [2025-02-06 02:38:31,470 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 16347 transitions. Word has length 405 [2025-02-06 02:38:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:31,472 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 16347 transitions. [2025-02-06 02:38:31,474 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 16347 transitions. [2025-02-06 02:38:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 02:38:31,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:31,483 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:38:31,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 107093406, now seen corresponding path program 1 times [2025-02-06 02:38:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:31,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185769339] [2025-02-06 02:38:31,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:31,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:31,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:32,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185769339] [2025-02-06 02:38:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185769339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:32,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760614843] [2025-02-06 02:38:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:32,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:32,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:32,145 INFO L87 Difference]: Start difference. First operand 9997 states and 16347 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:32,826 INFO L93 Difference]: Finished difference Result 19551 states and 31849 transitions. [2025-02-06 02:38:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:32,827 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-02-06 02:38:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:32,870 INFO L225 Difference]: With dead ends: 19551 [2025-02-06 02:38:32,870 INFO L226 Difference]: Without dead ends: 10511 [2025-02-06 02:38:32,895 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:38:32,896 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 367 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:32,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1232 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10511 states. [2025-02-06 02:38:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10511 to 9997. [2025-02-06 02:38:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 8875 states have (on average 1.5967323943661973) internal successors, (14171), 8899 states have internal predecessors, (14171), 1086 states have call successors, (1086), 35 states have call predecessors, (1086), 35 states have return successors, (1086), 1062 states have call predecessors, (1086), 1086 states have call successors, (1086) [2025-02-06 02:38:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 16343 transitions. [2025-02-06 02:38:33,511 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 16343 transitions. Word has length 405 [2025-02-06 02:38:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:33,513 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 16343 transitions. [2025-02-06 02:38:33,513 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, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 16343 transitions. [2025-02-06 02:38:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 02:38:33,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:33,522 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:38:33,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:33,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 208005373, now seen corresponding path program 1 times [2025-02-06 02:38:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619508396] [2025-02-06 02:38:33,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:35,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:35,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 36 proven. 123 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619508396] [2025-02-06 02:38:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619508396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264768515] [2025-02-06 02:38:36,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:36,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:36,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:36,742 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:38:36,744 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:38:36,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:37,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:37,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:37,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 02:38:37,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2045 proven. 123 refuted. 0 times theorem prover too weak. 3556 trivial. 0 not checked. [2025-02-06 02:38:38,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 36 proven. 123 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264768515] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:39,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-02-06 02:38:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094077921] [2025-02-06 02:38:39,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 02:38:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:39,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 02:38:39,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:38:39,168 INFO L87 Difference]: Start difference. First operand 9997 states and 16343 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-02-06 02:38:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:42,234 INFO L93 Difference]: Finished difference Result 24125 states and 38844 transitions. [2025-02-06 02:38:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 02:38:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 405 [2025-02-06 02:38:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:42,346 INFO L225 Difference]: With dead ends: 24125 [2025-02-06 02:38:42,347 INFO L226 Difference]: Without dead ends: 15029 [2025-02-06 02:38:42,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=2085, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 02:38:42,387 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 4992 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:42,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 3706 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 02:38:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15029 states. [2025-02-06 02:38:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15029 to 13777. [2025-02-06 02:38:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 12301 states have (on average 1.5832046175107715) internal successors, (19475), 12349 states have internal predecessors, (19475), 1406 states have call successors, (1406), 69 states have call predecessors, (1406), 69 states have return successors, (1406), 1358 states have call predecessors, (1406), 1406 states have call successors, (1406) [2025-02-06 02:38:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 22287 transitions. [2025-02-06 02:38:43,142 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 22287 transitions. Word has length 405 [2025-02-06 02:38:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:43,143 INFO L471 AbstractCegarLoop]: Abstraction has 13777 states and 22287 transitions. [2025-02-06 02:38:43,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-02-06 02:38:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 22287 transitions. [2025-02-06 02:38:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-06 02:38:43,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:43,157 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:43,168 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:38:43,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:43,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1277050178, now seen corresponding path program 1 times [2025-02-06 02:38:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899171291] [2025-02-06 02:38:43,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:44,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:44,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:44,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 48 proven. 111 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899171291] [2025-02-06 02:38:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899171291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665906803] [2025-02-06 02:38:45,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:45,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:45,387 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:38:45,390 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:38:45,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-06 02:38:45,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-06 02:38:45,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:45,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:45,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:45,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2643 proven. 54 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2025-02-06 02:38:45,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665906803] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:46,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-02-06 02:38:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671457508] [2025-02-06 02:38:46,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:46,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:38:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:38:46,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:38:46,343 INFO L87 Difference]: Start difference. First operand 13777 states and 22287 transitions. Second operand has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) [2025-02-06 02:38:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:47,771 INFO L93 Difference]: Finished difference Result 19513 states and 31457 transitions. [2025-02-06 02:38:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:38:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) Word has length 405 [2025-02-06 02:38:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:47,800 INFO L225 Difference]: With dead ends: 19513 [2025-02-06 02:38:47,800 INFO L226 Difference]: Without dead ends: 5997 [2025-02-06 02:38:47,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-02-06 02:38:47,823 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1416 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:47,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 2290 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:38:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2025-02-06 02:38:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 5589. [2025-02-06 02:38:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5589 states, 4903 states have (on average 1.5676116663267388) internal successors, (7686), 4911 states have internal predecessors, (7686), 646 states have call successors, (646), 39 states have call predecessors, (646), 39 states have return successors, (646), 638 states have call predecessors, (646), 646 states have call successors, (646) [2025-02-06 02:38:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 8978 transitions. [2025-02-06 02:38:48,110 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 8978 transitions. Word has length 405 [2025-02-06 02:38:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:48,111 INFO L471 AbstractCegarLoop]: Abstraction has 5589 states and 8978 transitions. [2025-02-06 02:38:48,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) [2025-02-06 02:38:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 8978 transitions. [2025-02-06 02:38:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-06 02:38:48,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:48,116 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,127 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:38:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:48,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1958441076, now seen corresponding path program 1 times [2025-02-06 02:38:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872110039] [2025-02-06 02:38:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:48,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:38:50,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:38:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 60 proven. 99 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872110039] [2025-02-06 02:38:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872110039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862789343] [2025-02-06 02:38:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:50,501 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:38:50,505 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:38:50,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 02:38:50,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 02:38:50,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:50,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:50,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2885 proven. 87 refuted. 0 times theorem prover too weak. 2752 trivial. 0 not checked. [2025-02-06 02:38:51,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 72 proven. 87 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862789343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:51,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 02:38:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128753108] [2025-02-06 02:38:51,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:38:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:51,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:38:51,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:38:51,458 INFO L87 Difference]: Start difference. First operand 5589 states and 8978 transitions. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) [2025-02-06 02:38:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:52,249 INFO L93 Difference]: Finished difference Result 8519 states and 13617 transitions. [2025-02-06 02:38:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:38:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) Word has length 406 [2025-02-06 02:38:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:52,265 INFO L225 Difference]: With dead ends: 8519 [2025-02-06 02:38:52,266 INFO L226 Difference]: Without dead ends: 3279 [2025-02-06 02:38:52,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:38:52,274 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 846 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:52,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1035 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:38:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-02-06 02:38:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3241. [2025-02-06 02:38:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 2705 states have (on average 1.511275415896488) internal successors, (4088), 2705 states have internal predecessors, (4088), 486 states have call successors, (486), 49 states have call predecessors, (486), 49 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-02-06 02:38:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5060 transitions. [2025-02-06 02:38:52,439 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5060 transitions. Word has length 406 [2025-02-06 02:38:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:52,441 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5060 transitions. [2025-02-06 02:38:52,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) [2025-02-06 02:38:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5060 transitions. [2025-02-06 02:38:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:38:52,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:52,445 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:52,457 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:38:52,646 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,SelfDestructingSolverStorable12 [2025-02-06 02:38:52,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1584309431, now seen corresponding path program 1 times [2025-02-06 02:38:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:52,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424830072] [2025-02-06 02:38:52,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:38:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:38:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424830072] [2025-02-06 02:38:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424830072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:38:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407228298] [2025-02-06 02:38:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:38:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:53,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:38:53,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:38:53,275 INFO L87 Difference]: Start difference. First operand 3241 states and 5060 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:54,672 INFO L93 Difference]: Finished difference Result 8413 states and 12958 transitions. [2025-02-06 02:38:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:38:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-02-06 02:38:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:54,697 INFO L225 Difference]: With dead ends: 8413 [2025-02-06 02:38:54,698 INFO L226 Difference]: Without dead ends: 5605 [2025-02-06 02:38:54,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:38:54,706 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1486 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:54,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1945 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:38:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5605 states. [2025-02-06 02:38:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5605 to 3463. [2025-02-06 02:38:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 2927 states have (on average 1.5244277417150667) internal successors, (4462), 2927 states have internal predecessors, (4462), 486 states have call successors, (486), 49 states have call predecessors, (486), 49 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-02-06 02:38:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5434 transitions. [2025-02-06 02:38:54,921 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5434 transitions. Word has length 408 [2025-02-06 02:38:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:54,922 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 5434 transitions. [2025-02-06 02:38:54,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5434 transitions. [2025-02-06 02:38:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:38:54,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:54,927 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:38:54,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:54,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1313138344, now seen corresponding path program 1 times [2025-02-06 02:38:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630628270] [2025-02-06 02:38:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:54,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:38:55,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:38:55,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:55,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:38:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630628270] [2025-02-06 02:38:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630628270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:55,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:38:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067937095] [2025-02-06 02:38:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:38:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:55,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:38:55,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:55,286 INFO L87 Difference]: Start difference. First operand 3463 states and 5434 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:55,899 INFO L93 Difference]: Finished difference Result 9729 states and 15191 transitions. [2025-02-06 02:38:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-02-06 02:38:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:55,927 INFO L225 Difference]: With dead ends: 9729 [2025-02-06 02:38:55,927 INFO L226 Difference]: Without dead ends: 6925 [2025-02-06 02:38:55,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:38:55,935 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 828 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:55,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1376 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2025-02-06 02:38:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 6265. [2025-02-06 02:38:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6265 states, 5257 states have (on average 1.5134106905078943) internal successors, (7956), 5257 states have internal predecessors, (7956), 918 states have call successors, (918), 89 states have call predecessors, (918), 89 states have return successors, (918), 918 states have call predecessors, (918), 918 states have call successors, (918) [2025-02-06 02:38:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6265 states to 6265 states and 9792 transitions. [2025-02-06 02:38:56,321 INFO L78 Accepts]: Start accepts. Automaton has 6265 states and 9792 transitions. Word has length 408 [2025-02-06 02:38:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:56,322 INFO L471 AbstractCegarLoop]: Abstraction has 6265 states and 9792 transitions. [2025-02-06 02:38:56,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:38:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6265 states and 9792 transitions. [2025-02-06 02:38:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:38:56,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:56,326 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:38:56,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:56,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash -620036647, now seen corresponding path program 1 times [2025-02-06 02:38:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:56,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219386371] [2025-02-06 02:38:56,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:56,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:38:57,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:38:57,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:57,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219386371] [2025-02-06 02:38:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219386371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021527139] [2025-02-06 02:38:58,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:58,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:58,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:38:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:38:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:38:58,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:58,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:58,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 563 proven. 6 refuted. 0 times theorem prover too weak. 5155 trivial. 0 not checked. [2025-02-06 02:38:58,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:38:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021527139] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:59,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:38:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603304364] [2025-02-06 02:38:59,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:38:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:59,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:38:59,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:59,216 INFO L87 Difference]: Start difference. First operand 6265 states and 9792 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:38:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:59,802 INFO L93 Difference]: Finished difference Result 12331 states and 19184 transitions. [2025-02-06 02:38:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:38:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 408 [2025-02-06 02:38:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:59,830 INFO L225 Difference]: With dead ends: 12331 [2025-02-06 02:38:59,830 INFO L226 Difference]: Without dead ends: 6433 [2025-02-06 02:38:59,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 813 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:38:59,845 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 602 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:59,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1000 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2025-02-06 02:39:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6111. [2025-02-06 02:39:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6111 states, 5086 states have (on average 1.4842705465985058) internal successors, (7549), 5086 states have internal predecessors, (7549), 918 states have call successors, (918), 106 states have call predecessors, (918), 106 states have return successors, (918), 918 states have call predecessors, (918), 918 states have call successors, (918) [2025-02-06 02:39:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 9385 transitions. [2025-02-06 02:39:00,268 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 9385 transitions. Word has length 408 [2025-02-06 02:39:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:00,269 INFO L471 AbstractCegarLoop]: Abstraction has 6111 states and 9385 transitions. [2025-02-06 02:39:00,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-02-06 02:39:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 9385 transitions. [2025-02-06 02:39:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:39:00,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:00,273 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 02:39:00,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 02:39:00,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:00,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1390276905, now seen corresponding path program 1 times [2025-02-06 02:39:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244186732] [2025-02-06 02:39:00,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:00,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:39:00,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:39:00,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:00,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:39:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244186732] [2025-02-06 02:39:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244186732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873514005] [2025-02-06 02:39:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:01,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:01,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:01,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:01,369 INFO L87 Difference]: Start difference. First operand 6111 states and 9385 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:01,922 INFO L93 Difference]: Finished difference Result 9887 states and 15223 transitions. [2025-02-06 02:39:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:01,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-02-06 02:39:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:01,947 INFO L225 Difference]: With dead ends: 9887 [2025-02-06 02:39:01,947 INFO L226 Difference]: Without dead ends: 3379 [2025-02-06 02:39:01,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:01,962 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 433 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1288 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-02-06 02:39:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3193. [2025-02-06 02:39:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2640 states have (on average 1.465530303030303) internal successors, (3869), 2640 states have internal predecessors, (3869), 486 states have call successors, (486), 66 states have call predecessors, (486), 66 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-02-06 02:39:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4841 transitions. [2025-02-06 02:39:02,302 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4841 transitions. Word has length 408 [2025-02-06 02:39:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:02,303 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4841 transitions. [2025-02-06 02:39:02,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4841 transitions. [2025-02-06 02:39:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:39:02,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:02,306 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:39:02,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -992750601, now seen corresponding path program 1 times [2025-02-06 02:39:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287396589] [2025-02-06 02:39:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:39:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:39:02,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:02,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:39:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287396589] [2025-02-06 02:39:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287396589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:03,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:03,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:39:03,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438489027] [2025-02-06 02:39:03,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:03,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:39:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:39:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:39:03,048 INFO L87 Difference]: Start difference. First operand 3193 states and 4841 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:03,769 INFO L93 Difference]: Finished difference Result 8888 states and 13498 transitions. [2025-02-06 02:39:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:39:03,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-02-06 02:39:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:03,794 INFO L225 Difference]: With dead ends: 8888 [2025-02-06 02:39:03,794 INFO L226 Difference]: Without dead ends: 6023 [2025-02-06 02:39:03,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:39:03,803 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1296 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:03,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1929 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:39:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2025-02-06 02:39:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 5077. [2025-02-06 02:39:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5077 states, 4392 states have (on average 1.4943078324225865) internal successors, (6563), 4400 states have internal predecessors, (6563), 606 states have call successors, (606), 78 states have call predecessors, (606), 78 states have return successors, (606), 598 states have call predecessors, (606), 606 states have call successors, (606) [2025-02-06 02:39:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5077 states to 5077 states and 7775 transitions. [2025-02-06 02:39:04,091 INFO L78 Accepts]: Start accepts. Automaton has 5077 states and 7775 transitions. Word has length 408 [2025-02-06 02:39:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:04,092 INFO L471 AbstractCegarLoop]: Abstraction has 5077 states and 7775 transitions. [2025-02-06 02:39:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 7775 transitions. [2025-02-06 02:39:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:39:04,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:04,096 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:04,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 02:39:04,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash -223580586, now seen corresponding path program 1 times [2025-02-06 02:39:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228051575] [2025-02-06 02:39:04,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:04,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:39:04,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:39:04,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:04,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-02-06 02:39:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228051575] [2025-02-06 02:39:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228051575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206663383] [2025-02-06 02:39:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:04,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:04,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:04,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:04,722 INFO L87 Difference]: Start difference. First operand 5077 states and 7775 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:05,723 INFO L93 Difference]: Finished difference Result 10965 states and 16698 transitions. [2025-02-06 02:39:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-02-06 02:39:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:05,750 INFO L225 Difference]: With dead ends: 10965 [2025-02-06 02:39:05,750 INFO L226 Difference]: Without dead ends: 6333 [2025-02-06 02:39:05,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:05,762 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 947 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:05,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1443 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:39:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2025-02-06 02:39:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 5286. [2025-02-06 02:39:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4601 states have (on average 1.4992392958052598) internal successors, (6898), 4609 states have internal predecessors, (6898), 606 states have call successors, (606), 78 states have call predecessors, (606), 78 states have return successors, (606), 598 states have call predecessors, (606), 606 states have call successors, (606) [2025-02-06 02:39:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8110 transitions. [2025-02-06 02:39:06,111 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8110 transitions. Word has length 408 [2025-02-06 02:39:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:06,111 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 8110 transitions. [2025-02-06 02:39:06,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-02-06 02:39:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8110 transitions. [2025-02-06 02:39:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-06 02:39:06,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:06,116 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 02:39:06,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1867040632, now seen corresponding path program 1 times [2025-02-06 02:39:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547250065] [2025-02-06 02:39:06,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:06,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:39:07,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:39:07,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:07,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 93 proven. 66 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-02-06 02:39:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547250065] [2025-02-06 02:39:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547250065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229723518] [2025-02-06 02:39:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:08,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:08,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 02:39:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 02:39:09,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 02:39:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:09,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 02:39:09,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 4282 proven. 258 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2025-02-06 02:39:11,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:39:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 366 proven. 102 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2025-02-06 02:39:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229723518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:39:13,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:39:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 22] total 55 [2025-02-06 02:39:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930129360] [2025-02-06 02:39:13,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:39:13,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 02:39:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:13,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 02:39:13,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 02:39:13,445 INFO L87 Difference]: Start difference. First operand 5286 states and 8110 transitions. Second operand has 55 states, 55 states have (on average 7.2727272727272725) internal successors, (400), 55 states have internal predecessors, (400), 15 states have call successors, (162), 7 states have call predecessors, (162), 16 states have return successors, (162), 15 states have call predecessors, (162), 15 states have call successors, (162)